66 search results - page 12 / 14 » The Polytope of Tree-Structured Binary Constraint Satisfacti... |
CPC
2006
13 years 5 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
ICCAD
1994
IEEE
13 years 9 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
CP
2006
Springer
13 years 9 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
JAIR
2011
13 years 9 days ago
2011
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...