Author:
Denenberg Larry,Lewis Harry R.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. A. Adachi, S. Iwata, and T. Kasai, Low level complexity for combinatorial games, Proceedings of 13th SIGACT Symposium, 228–237.
2. S. A. Cook, The complexity of theorem-proving procedures, Proceedings, Third SIGACT Symposium, 151–178.
3. A. Chandra, H. R. Lewis, and J. Makowsky, Embedded implicational dependencies and their inference problem, JCSS, to appear.
4. L. Denenberg, Computational Complexity of Logical Problems: Formulas, Dependencies, and Circuits, PhD thesis, Harvard University, Division of Applied Sciences.
5. L. Denenberg and H. R. Lewis, The complexity of the satisfiability problem for Krom formulas, Theoretical Computer Science 30, to appear.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Resolution and the Decision Problem;Logic and Foundations of Mathematics;1999
2. Bibliography;Logic-Based Decision Support - Mixed Integer Model Formulation;1989