Nested satisfiability
classification
💻 cs.CC
keywords
clausessatisfiabilityassumingbeencaseconvenienthierarchicallinear
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.