Nested satisfiability
| dc.creator | Knuth, Donald E. | |
| dc.date | 1990-01-01 | |
| dc.date.accessioned | 2026-07-07T09:12:16Z | |
| dc.date.available | 2026-07-07T09:12:16Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/9301111 | |
| dc.identifier | http://arxiv.org/abs/cs/9301111 | |
| dc.identifier | Acta Inform. 28 (1990), no. 1, 1--6 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151965 | |
| dc.subject | Computational Complexity | |
| dc.title | Nested satisfiability | |
| dc.type | text |