Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A hierarchy for nondeterministic time complexity
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the computational limits of infinite satisfaction
Proceedings of the 2005 ACM symposium on Applied computing
Hi-index | 0.00 |