SIGACT News complexity theory column 32
ACM SIGACT News
Reducing the number of solutions of NP functions
Journal of Computer and System Sciences
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Open questions in the theory of semifeasible computation
ACM SIGACT News
Journal of Computer and System Sciences
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
Proving SAT does not have small circuits with an application to the two queries problem
Journal of Computer and System Sciences
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
The 1-versus-2 queries problem revisited
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Complexity classes of equivalence problems revisited
Information and Computation
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
Oblivious symmetric alternation
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A note on zero error algorithms having oracle access to one NP query
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Survey: The consequences of eliminating NP solutions
Computer Science Review
| Hi-index | 0.89 |