1383 search results - page 199 / 277 » On the Complexity of the Interlace Polynomial |
223
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
168
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
181
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
184
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
136
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specifica...