Nested satisfiability

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.

Keywords

Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/151965

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9301111
 http://arxiv.org/abs/cs/9301111
 Acta Inform. 28 (1990), no. 1, 1--6

Collections

arXiv