论文信息 - The inequality-satisfiability problem

The inequality-satisfiability problem

We define a generalization of the satisfiability problem (SAT) where each ''clause'' is an or-list of inequalities in n variables. This problem is NP-complete even when containing only two inequalities per ''clause'', but solvable in polynomial time when either the number of variables or the number of ''clauses'' is fixed.

Dorit S. Hochbaum | Erick Moreno-Centeno | D. Hochbaum | Erick Moreno-Centeno

[1] Mark A. Ganter,et al. Feature extraction for casting core development , 1993, DAC 1991.

[2] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[3] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[4] K. C. Hui,et al. Mould design with sweep operations - a heuristic search approach , 1992, Comput. Aided Des..

[5] 안희갑. Separating an Object from its Cast. , 1997 .

[6] B. Ravi,et al. Decision criteria for computer-aided parting surface design , 1990, Comput. Aided Des..

[7] Sara McMains,et al. Finding feasible mold parting directions using graphics hardware , 2006, Comput. Aided Des..

[8] H. P. Williams. THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[9] Bruce W. Weide,et al. On the complexity of computing the measure of ∪[ai,bi] , 1978, CACM.

[10] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.