STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Information and Computation
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Proving SAT does not have small circuits with an application to the two queries problem
Journal of Computer and System Sciences
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
Oblivious symmetric alternation
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |