Author of the publication

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.

 

Other publications of authors with the same name

Computability and Complexity Theory, Second Edition., and . Texts in Computer Science Springer, (2011)Computability and Complexity Theory., and . Texts in Computer Science Springer, (2001)The Complexity of Unions of Disjoint Sets., , , and . STACS, volume 4393 of Lecture Notes in Computer Science, page 248-259. Springer, (2007)Computing Solutions Uniquely Collapses the Polynomial Hierarchy., , , and . SIAM J. Comput., 25 (4): 697-708 (1996)Canonical Disjoint NP-Pairs of Propositional Proof Systems, , and . Electronic Colloquium on Computational Complexity (ECCC), (2004)Disjoint NP-Pairs and Propositional Proof Systems., , , and . SIGACT News, 45 (4): 59-75 (2014)The Complexity of Promise Problems with Applications to Public-Key Cryptography, , and . Information and Control, 61 (2): 159-173 (May 1984)Autoreducibility, Mitoticity, and Immunity., , , , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 387-398. Springer, (2005)P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility., , , and . J. Comput. Syst. Sci., 53 (2): 194-209 (1996)Complete distributional problems, hard languages, and resource-bounded measure., and . Theor. Comput. Sci., 234 (1-2): 273-286 (2000)