363 search results - page 1 / 73 » The SAT Phase Transition |
SAT
2005
Springer
13 years 9 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
JSAT
2006
13 years 4 months ago
2006
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
CP
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
ECAI
1994
Springer
13 years 8 months ago
1994
Springer
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...