Author of the publication

Optimal Proof Systems and Sparse Sets.

, , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 407-418. Springer, (2000)

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

Functions that preserve p-randomness. CoRR, (2012)Two oracles that force a big crunch., , , and . Comput. Complex., 10 (2): 93-116 (2001)The complexity of learning SUBSEQ(A)., , and . J. Symb. Log., 74 (3): 939-975 (2009)The Isomorphism Conjecture Holds Relative to an Oracle., , and . SIAM J. Comput., 25 (1): 193-206 (1996)Complexity of Regex Crosswords., and . LATA, volume 11417 of Lecture Notes in Computer Science, page 215-230. Springer, (2019)Complexity Theory Newsflash., , and . SIGACT News, 27 (3): 126 (1996)Gap-Definable Counting Classes., , and . J. Comput. Syst. Sci., 48 (1): 116-148 (1994)The complexity of learning SUBSEQ(A)., , and . Electron. Colloquium Comput. Complex., (2008)Quantum Algorithms for a Set of Group Theoretic Problems., and . Int. J. Found. Comput. Sci., 26 (2): 255-268 (2015)Implementing the fanout operation with simple pairwise interactions., and . CoRR, (2022)