Author:
Denenberg Larry,Lewis Harry R
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. On the decision problem for formulas in which all disjunctions are binary;Aanderaa;Proc. 2nd Scandinavian Logic Symp.,1971
2. Prefix classes of Krom formulas;Aanderaa;J. Symbolic Logic,1973
3. A linear time algorithm for testing the truth of certain quantified boolean formulas;Aspvall;Inform. Process. Lett.,1979
4. Reduktionstypen in Krom- und Hornformeln;Börger,1971
5. Embedded implicational dependencies and their inference problem;Chandra,1981
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Building tractable disjunctive constraints;Journal of the ACM;2000-09
2. Complexity of Logical Decision Problems: An Introduction;Bridging the Gap: Philosophy, Mathematics, and Physics;1993
3. Bibliography;Computability, Complexity, Logic;1989
4. First-Order Formulas in Conjunctive Quantificational Form;Zeitschrift für Mathematische Logik und Grundlagen der Mathematik;1988
5. Logical syntax and computational complexity;Computation and Proof Theory;1984