Electronic Resource
Springer
Theory of computing systems
13 (1979), S. 45-53
ISSN:
1433-0490
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract For each fixed set of Boolean connectives, how hard is it to determine satisfiability for formulas with only those connectives? We show that a condition sufficient for NP-completeness is that the functionx Λ ~ y be representable, and that any set of connectives not capable of representing this function has a polynomial-time satisfiability problem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01744287
Permalink
|
Location |
Call Number |
Expected |
Availability |