Backdoors into two occurrences
From MaRDI portal
Publication:5014282
Recommendations
Cites work
- scientific article; zbMATH DE number 1470716 (Why is no real title available?)
- Backdoors to satisfaction
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- Parametrized complexity theory.
- STACS 2004
- Solving \#SAT using vertex covers
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- Variable and term removal from Boolean formulae
- Which problems have strongly exponential complexity?
Cited in
(6)
This page was built for publication: Backdoors into two occurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014282)