Pages that link to "Item:Q1342216"

The following pages link to Exploiting the deep structure of constraint problems (Q1342216):

Displaying 29 items.

• Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
• Revisiting global constraint satisfaction (Q1129109) (← links)
• Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552) (← links)
• The hardest constraint problems: A double phase transition (Q1337687) (← links)
• On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
• Experimental complexity analysis of continuous constraint satisfaction problems. (Q1425278) (← links)
• A framework for structured quantum search. (Q1586960) (← links)
• GA performance distributions and randomly generated binary constraint satisfaction problems. (Q1853463) (← links)
• Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375) (← links)
• Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
• Constructive generation of very hard 3-colorability instances (Q2467358) (← links)
• Phase transitions and the search problem (Q2674173) (← links)
• The satisfiability constraint gap (Q2674178) (← links)
• An empirical study of phase transitions in binary constraint satisfaction problems (Q2674179) (← links)
• Refining the phase transition in combinatorial search (Q2674181) (← links)
• Locating the phase transition in binary constraint satisfaction problems (Q2674182) (← links)
• Implicates and prime implicates in random 3-SAT (Q2674186) (← links)
• A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
• Problem structure heuristics and scaling behavior for genetic algorithms (Q2674193) (← links)
• The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
• Quantum computation and quantum information† (Q3375535) (← links)
• EPIDEMIOLOGY MODEL ON SHORTCUT AND SMALL WORLD NETWORKS (Q3635825) (← links)
• Fine-grained conflict resolution in constraint satisfaction problems (Q4420771) (← links)
• SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation (Q4443408) (← links)
• A new method for testing decision procedures in modal logics (Q5234709) (← links)
• Another look at the phenomenon of phase transition (Q5704529) (← links)
• Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard (Q5958710) (← links)
• Constructing an asymptotic phase transition in random binary constraint satisfaction problems (Q5958810) (← links)