In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Exact learning algorithms, betting games, and circuit lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Efficient learning algorithms yield circuit lower bounds
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
ACM Transactions on Computation Theory (TOCT)
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
| Hi-index | 0.01 |