Abstract
Cook [1] and Karp [2] introduced the notion of complete problems. Meyer and Stockmeyer [3] showed that some problems require exponential time. All these problems have a common property which in the latter case implies that they cannot be solved in polynomial time.
Publisher
Association for Computing Machinery (ACM)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SIGACT News Complexity Theory Column 115;ACM SIGACT News;2022-12-19
2. The opacity of backbones;Information and Computation;2021-12
3. Complexity of counting the optimal solutions;Theoretical Computer Science;2009-09
4. Lower bounds and the hardness of counting properties;Theoretical Computer Science;2004-10
5. Lower Bounds and the Hardness of Counting Properties;Foundations of Information Technology in the Era of Network and Mobile Computing;2002