Satisfiability Problems Complete for Deterministic Logarithmic Space

The satisfiability and not-all-equal satisfiability problems for boolean formulas in CNF with at most two occurrences of each variable are complete for deterministic logarithmic space.

[1]  Hans Kleine Büning,et al.  Aussagenlogik - Deduktion und Algorithmen , 1994, Leitfäden und Monographien der Informatik.

[2]  Stefan Porschen,et al.  Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems , 2003, SAT.

[3]  Stephen A. Cook,et al.  Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.

[4]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[5]  David A. Plaisted.  Complete Problems in the First-Order Predicate Calculus , 1984, J. Comput. Syst. Sci..

[6]  Neil D. Jones,et al.  New problems complete for nondeterministic log space , 1976, Mathematical systems theory.

[7]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[8]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.