Abstract
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.
References
Cook, S.A.: The complexity of theorem proving procedures. In: Proc. 3rd ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Plaisted, D.A.: Complete problems in the first-order predicate calculus. Journal of Computer and System Sciences 29, 8–35 (1984)
Jones, N.D., Lien, Y.E., Laaser, W.T.: New problems complete for nondeterministic log space. Mathematical Systems Theory 10, 1–17 (1976)
Kleine Büning, H., Lettman, T.: Aussagenlogik: Deduktion und Algorithmen. Teubner, Stuttgart (1994)
Lewis, H.R., Papadimitriou, C.H.: Symmetric space-bounded computation. Theoretical Computer Science 19, 161–187 (1982)
Porschen, S., Randerath, B., Speckenmeyer, E.: Linear time algorithms for some not-all-equal satisfiability problems. In: Proc. 6th International Conference on Theory and Applications of Satisfiability Testing. LNCS (LNAI), Springer, Heidelberg (2003)
Braverman, M.: Witnessing SAT(2) and NAE-SAT(2) in L. Unpublished notes (November 2003)
Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)
Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. Journal of Algorithms 8, 385–394 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johannsen, J. (2004). Satisfiability Problems Complete for Deterministic Logarithmic Space. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive