Author of the publication

Reductions between Disjoint NP-Pairs.

, , and . Computational Complexity Conference, page 42-53. IEEE Computer Society, (2004)

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

Some Observations on NP, Real Numbers and P-Selective Sets.. J. Comput. Syst. Sci., 23 (3): 326-332 (1981)Complete distributional problems, hard languages, and resource-bounded measure., and . Theor. Comput. Sci., 234 (1-2): 273-286 (2000)Computability and Complexity Theory., and . Texts in Computer Science Springer, (2001)The Complexity of Disjoint Unions., , , and . Technical Report, 384. Department of Computer Science, (April 2006)Complexity Measures for Public-Key Cryptosystems., and . SIAM J. Comput., 17 (2): 309-335 (1988)P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability., , and . SCT, page 52-64. IEEE Computer Society, (1993)Separation of NP-Completeness Notions., and . CCC, page 78-89. IEEE Computer Society, (2001)A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP., and . CCC, page 224-232. IEEE Computer Society, (1996)Complexity Theory Retrospective. Springer, (1990)Qualitative Relativizations of Complexity Classes., , and . J. Comput. Syst. Sci., 30 (3): 395-413 (1985)