Pages that link to "Item:Q1337687"

The following pages link to The hardest constraint problems: A double phase transition (Q1337687):

Displaying 30 items.

• An improved upper bound on the non-3-colourability threshold (Q293171) (← links)
• Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study (Q293254) (← links)
• Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
• Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← links)
• Statistical regimes across constrainedness regions (Q850446) (← links)
• The impact of search heuristics on heavy-tailed behaviour (Q850467) (← links)
• A generative power-law search tree model (Q1010292) (← links)
• Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552) (← links)
• Easy problems are sometimes hard (Q1342226) (← links)
• The TSP phase transition (Q1391912) (← links)
• Experimental complexity analysis of continuous constraint satisfaction problems. (Q1425278) (← links)
• Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
• Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT (Q1777400) (← links)
• Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
• Constructive generation of very hard 3-colorability instances (Q2467358) (← links)
• Towards a practical engineering tool for rostering (Q2468743) (← links)
• Phase transitions and the search problem (Q2674173) (← links)
• Experimental results on the crossover point in random 3-SAT (Q2674177) (← 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)
• Implicates and prime implicates in random 3-SAT (Q2674186) (← links)
• Critical behavior in the computational cost of satisfiability testing (Q2674189) (← links)
• Problem structure heuristics and scaling behavior for genetic algorithms (Q2674193) (← links)
• Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
• A Model to Study Phase Transition and Plateaus in Relational Learning (Q3543267) (← links)
• Complexity studies of a temporal constraint propagation algorithm: a statistical analysis (Q4421240) (← links)
• Complexity of Coloring Random Graphs (Q4577957) (← links)
• Frozen development in graph coloring (Q5958809) (← links)
• Constructing an asymptotic phase transition in random binary constraint satisfaction problems (Q5958810) (← links)