Log depth circuits for division and related problems
SIAM Journal on Computing
NP is as easy as detecting unique solutions
Theoretical Computer Science
Dynamic parallel complexity of computational circuits
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Efficient parallel evaluation of straight-line code and arithmetic circuits
SIAM Journal on Computing
A new pebble game that characterizes parallel complexity classes
SIAM Journal on Computing
On the power of uniform families of constant depth threshold circuits
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Lower bounds for non-commutative computation
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the parallel evaluation of classes of circuits
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Properties that characterize LOGCFL
Journal of Computer and System Sciences
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
An arithmetic model of computation equivalent to threshold circuits
Theoretical Computer Science
On threshold circuits and polynomial computation
SIAM Journal on Computing
Circuit definitions of nondeterministic complexity classes
SIAM Journal on Computing
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
A circuit-based proof of Toda's theorem
Information and Computation
Depth reduction for circuits of unbounded fan-in
Information and Computation
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Some Exact Complexity Results for Straight-Line Computations over Semirings
Journal of the ACM (JACM)
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A note on the power of threshold circuits
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Theoretical Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hi-index | 0.00 |