Sciweavers

Share
43 search results - page 1 / 9
» Phase Transitions of Bounded Satisfiability Problems
Sort
View
IJCAI
2003
11 years 2 months ago
Phase Transitions of Bounded Satisfiability Problems
Delbert D. Bailey, Phokion G. Kolaitis
AAAI
2008
11 years 3 months ago
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
Yong Gao
SAT
2005
Springer
104views Hardware» more  SAT 2005»
11 years 7 months ago
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
We introduce two incomplete polynomial time algorithms to solve satis´Čüability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
Marijn Heule, Hans van Maaren
JAIR
2010
90views more  JAIR 2010»
10 years 8 months ago
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
Gerold Jäger, Weixiong Zhang
JAIR
1998
92views more  JAIR 1998»
11 years 1 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
books