159 search results - page 18 / 32 » On the Complexity of SAT |
169
click to vote
CIE
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
151
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
204
click to vote
IFIP
2001
Springer
15 years 10 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
169
click to vote
FOCS
2009
IEEE
16 years 15 days ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
147
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...