46 search results - page 4 / 10 » Measures of Intrinsic Hardness for Constraint Satisfaction P... |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
IJCAI
2001
13 years 7 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
CSCLP
2004
Springer
13 years 11 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
EVOW
2005
Springer
13 years 11 months ago
2005
Springer
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
FOCS
2004
IEEE
13 years 9 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...