论文信息 - Complexity of partial satisfaction

Complexity of partial satisfaction

A conjunctive normal form (cnf) is 2-satisfiable, iff any 2 of its clauses are satisfiable. It is shown that every 2-satisfiable cnf s has an interpretation which satisfies at least h¿length(s) clauses (h=(√5-1)/2∼0.618). This result is optimal, insofar as the given constant h is maximal. The proof is polynomially constructive, i.e., it yields a polynomial algorithm, which computes an interpretation satisfying h¿length(s) clauses for the 2-satisfiable cnf's s. Moreover, if h¿h' and h' is e.g. algebraic, the following set is NP-complete: The 2-satisfiable cnf's s having an interpretation which satisfies at least h'¿length(s) clauses.

Karl J. Lieberherr | Ernst Specker | E. Specker | K. Lieberherr

[1] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[2] Journal of the Association for Computing Machinery , 1961, Nature.

[3] David S. Johnson,et al. Some simplified NP-complete problems , 1974, STOC '74.

[4] R. Carmichael,et al. Introduction to the theory of groups of finite order , 1908 .

[5] P. Erdös,et al. On coloring graphs to maximize the proportion of multicolored k-edges , 1968 .

[6] E. Landau. Handbuch der Lehre von der Verteilung der Primzahlen , 1974 .

[7] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[8] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[9] Karl J. Lieberherr,et al. Complexity of Partial Satisfaction , 1979, FOCS.

[10] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[11] Karl J. Lieberherr,et al. P-Optimal Heuristics , 1980, Theor. Comput. Sci..

[12] Karl J. Lieberherr. Probabilistic Combinatorial Optimization , 1981, MFCS.

[13] E. Landau,et al. Handbuch der Lehre von der Verteilung der Primzahlen , 1974 .

[14] David S. Johnson,et al. Approximation algorithms for combinatorial problems: an annotated bibliography , 1976 .

[15] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..