10997 search results - page 42 / 2200 » On the Structure of Complete Sets |
ECCC
2006
13 years 10 months ago
2006
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
JDA
2007
13 years 10 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
JSC
2010
13 years 8 months ago
2010
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
CGI
2006
IEEE
14 years 4 months ago
2006
IEEE
A novel approach for appearance and geometry completion over point-sampled geometry is presented in this paper. Based on the result of surface clustering and the given texture samp...
LMCS
2006
13 years 10 months ago
2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...