PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Vereshchagin, Nikolai K."

Author of the publication

copydeleteadd this publication to your clipboard
Sparse Selfreducible Sets and Nonuniform Lower Bounds.

, , , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

K. Stahl

Nikolai Klempp University of Stuttgart

K. Gaiser

Nikolai Otto University of Stuttgart

K. Lindow

 

Other publications of authors with the same name

Logical operations and Kolmogorov complexity., and . Theor. Comput. Sci., 271 (1-2): 125-129 (2002)Arthur-Merlin Games in Boolean Decision Trees., , , and . J. Comput. Syst. Sci., 59 (2): 346-372 (1999)Descriptive complexity of computable sequences., , and . Theor. Comput. Sci., 271 (1-2): 47-58 (2002)Limit complexities revisited once more, , , and . CoRR, (2012)Inverting Onto Functions and Polynomial Hierarchy., , , , and . CSR, volume 4649 of Lecture Notes in Computer Science, page 92-103. Springer, (2007)Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle., , , and . CSL, volume 2471 of Lecture Notes in Computer Science, page 74-88. Springer, (2002)Randomised Individual Communication Complexity., , and . Computational Complexity Conference, page 321-331. IEEE Computer Society, (2008)Increasing Kolmogorov Complexity, , , and . Electronic Colloquium on Computational Complexity (ECCC), (2004)Sparse Selfreducible Sets and Nonuniform Lower Bounds., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)Kolmogorov complexity of enumerating finite sets. Electronic Colloquium on Computational Complexity (ECCC), (2004)