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
Improved Quantum Algorithms for Subset Sum and k-SUM
Nikolai Chukhin, Alexander S. Kulikov, Maksim Levitskii et al.
On the Hardness of Strong Metric Dimension
Prafullkumar Tale
Superlogarithmic-Rank Matrix Rigidity for the Walsh-Hadamard Transform
Josh Alman
Tight Inapproximability of Max Independent Set in Triangle-Free Graphs
Édouard Bonnet
The blue pebbling cost and the space in tree-like and negative Resolution
Lisa-Marie Jaser, Jacobo Torán
Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
Xuan Chen, Shuangping Li