1225 search results - page 23 / 245 » The Instance Complexity Conjecture |
102
Voted
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
102
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
106
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
JDA
2010
15 years 10 days ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
123
click to vote
VIP
2000
15 years 3 months ago
2000
This paper presents a model for describing visualisation by considering individual parts of an instance and relating them to each other. The resulting part-relationship structure ...