159 search results - page 22 / 32 » On the Complexity of SAT |
DATE
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
103
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
91
Voted
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
AAAI
2004
14 years 11 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
90
Voted
SAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...