A new polynomial-time algorithm for linear programming
Combinatorica
A taxonomy of problems with fast parallel algorithms
Information and Control
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Journal of Computer and System Sciences
Machine models and simulations
Handbook of theoretical computer science (vol. A)
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Efficient exponentiation in finite fields (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On threshold circuits and polynomial computation
SIAM Journal on Computing
Circuit complexity and neural networks
Circuit complexity and neural networks
The complexity of iterated multiplication
Information and Computation
Average-case computational complexity theory
Complexity theory retrospective II
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Computational Complexity and the Existence of Complexity Gaps
Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Bounding Fan-out in Logical Networks
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
A Note on the Simulation of Exponential Threshold Weights
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A personal view of average-case complexity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Translational methods and computational complexity
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs
Journal of Computer and System Sciences
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Time and parallelizability results for parity games with bounded treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |