The complexity of the satisfiability problem for Krom formulas
- 31 December 1984
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 30 (3) , 319-341
- https://doi.org/10.1016/0304-3975(84)90138-5
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- AlternationJournal of the ACM, 1981
- Complexity results for classes of quantificational formulasJournal of Computer and System Sciences, 1980
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Resolution Strategies as Decision ProceduresJournal of the ACM, 1976
- Prefix classes of Krom formulasThe Journal of Symbolic Logic, 1973
- On the Decision Problem for Formulas in which all Disjunctions are BinaryPublished by Elsevier ,1971
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASEProceedings of the National Academy of Sciences, 1962
- Zum Entscheidungsproblem des logischen FunktionenkalkülsMonatshefte für Mathematik, 1933