Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference6 articles.
1. The complexity of theorem-proving procedures;Cook;Proc. 3rd Ann. ACM Symp. on Theory of Computing,1971
2. Generic Reduction Computers;Dewdney,1985
3. Relations among complexity measures;Pippenger;J. ACM,1979
4. A new proof of the NP completeness of satisfiability;Robson;Proc. 2nd Australian Computer Science Conf.,1979
5. Satisfiability is quasilinear complete in NQL;Schnorr;J. ACM,1978
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Rigid Matrices from Rectangular PCPs;SIAM Journal on Computing;2024-04-03
2. Log-Linear-Based Logic Mining with Multi-Discrete Hopfield Neural Network;Mathematics;2023-04-30
3. Smoothing the Gap Between NP and ER;SIAM Journal on Computing;2022-04-07
4. Chapter 7. Proof Complexity and SAT Solving;Frontiers in Artificial Intelligence and Applications;2021-02-02
5. Smoothing the gap between NP and ER;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11