Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Theories of computability
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The circuit value problem is log space complete for P
ACM SIGACT News
Journal of the ACM (JACM)
| Hi-index | 0.02 |