The random oracle hypothesis is false
Journal of Computer and System Sciences
ACM SIGACT News
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Towards a Cardinality Theorem for Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Boolean Hierarchy of NP-Partitions
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Boolean Lowness and Boolean Highness
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Exact complexity of exact-four-colorability
Information Processing Letters
On the computational complexity of qualitative coalitional games
Artificial Intelligence
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proving SAT does not have small circuits with an application to the two queries problem
Journal of Computer and System Sciences
The boolean hierarchy of NP-partitions
Information and Computation
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Extending downward collapse from 1-versus-2 queries to j-versus-j + 1 queries
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The 1-versus-2 queries problem revisited
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
Observations on complete sets between linear time and polynomial time
Information and Computation
Oblivious symmetric alternation
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences
| Hi-index | 0.00 |