On Some Aspects of Mixed Horn Formulas
From MaRDI portal
Publication:3637161
DOI10.1007/978-3-642-02777-2_11zbMath1247.68114MaRDI QIDQ3637161
Ewald Speckenmeyer, Tatjana Schmidt, Stefan Porschen
Publication date: 7 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_11
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Nested satisfiability
- Satisfiability of mixed Horn formulas
- Linear CNF formulas and satisfiability
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
- STACS 2004
- The complexity of satisfiability problems
- Unnamed Item
- Unnamed Item