Satisfiability Problems Complete for Deterministic Logarithmic Space

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.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Johannsen, Jan
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-24749-4_28