Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third ACM Symposium on Theory of Computing, pages 151–158, 1971.
2. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394–397, 1962.
3. M. Davis and H. Putnam. A computing procedure for quantification theory. J. of ACM, 7:201–215, 1960.
4. J. Franco and M. Paull. Probabilistic analysis of the davis-putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5:77–87, 1983.
5. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献