Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Sparse sets versus complexity classes
Complexity theory retrospective II
Sparse hard sets for P: resolution of a conjecture of Hartmanis
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Satisfiability Is Quasilinear Complete in NQL
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
New Developments in Structural Complexity Theory
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
On the Existence of Hard Sparse Sets under Weak Reductions
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P
ACM SIGACT News
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Hi-index | 0.00 |