Nested satisfiability
计算复杂性
2008-02-03 v1
摘要
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.
引用
@article{arxiv.cs/9301111,
title = {Nested satisfiability},
author = {Donald E. Knuth},
journal= {arXiv preprint arXiv:cs/9301111},
year = {2008}
}