Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The monotone circuit complexity of Boolean functions
Combinatorica
On the method of approximations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
A simple lower bound for monotone clique using a communication game
Information Processing Letters
Monotone circuits for matching require linear depth
Journal of the ACM (JACM)
Finite Limits and Monotone Computations: The Lower Bounds Criterion
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Note: Limiting negations in non-deterministic circuits
Theoretical Computer Science
Hi-index | 0.00 |