Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Threshold functions and bounded depth monotone circuits
Journal of Computer and System Sciences
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The logarithmic alternation hierarchy collapses: A&Sgr;L-2- = A&Pgr;L-2-
14th International Colloquium on Automata, languages and programming
The monotone circuit complexity of Boolean functions
Combinatorica
Languages that capture complexity classes
SIAM Journal on Computing
The complexity of Boolean functions
The complexity of Boolean functions
Are there interactive protocols for CO-NP languages?
Information Processing Letters
The complexity of Boolean networks
The complexity of Boolean networks
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of 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
On the method of approximations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the distributional complexity of disjointness
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Communication complexity towards lower bounds on circuit depth
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Computational Work and Time on Finite Machines
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
A Logical Approach to the Problem "P=NP?"
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Some connections between mathematical logic and complexity theory
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Independence results in computer science
ACM SIGACT News
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Power balance and apportionment algorithms for the United States Congress
Journal of Experimental Algorithmics (JEA)
Progress in Quantum Algorithms
Quantum Information Processing
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Language constrained graph problems: a microcosm of engineering research and development
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Some Theorems Concerning the Core Function
Concurrency, Graphs and Models
Tricolorable torus knots are NP-complete
Proceedings of the 47th Annual Southeast Regional Conference
A tool for comparing resource-constrained project scheduling problem algorithms
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Evolutionary techniques in a constraint satisfaction problem: puzzle eternity II
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Other complexity classes and measures
Algorithms and theory of computation handbook
Philosophy of Mind Is (in Part) Philosophy of Computer Science
Minds and Machines
| Hi-index | 0.00 |