Nested satisfiability
Donald E. Knuth
Abstract
A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
Create a lesson
Related papers
Ideal Membership in Polynomial Calculus: Complexity and Reductions
Alex Bortolotti, Monaldo Mastrolilli
Lettericity Is NP-Complete
Henning Fernau, Samuel German, Kevin Mann
Certification complexity of Boolean functions
Chandrima Kayal, Sophie Laplante, Émile Larroque et al.
4-Block Integer Programming is in FPT
Martin Koutecký, Alexandra Lassota, Koen Ligthart
Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity
Paul Beame, Niels Kornerup, Michael Whitmeyer
Improved Algorithms for the Remote Point Problem
Ben Lee Volk