The following pages link to (Q4704799):
Displaying 47 items.
- Phase transitions of contingent planning problem (Q474510) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The set of solutions of random XORSAT formulae (Q748322) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- A note on the complexity of Boolean concepts (Q856652) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- Typical case complexity and phase transitions. Papers from the workshop, Ottawa, ON, Canada, May 14--16, 2003 (Q878331) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Random subcubes as a toy model for constraint satisfaction problems (Q937116) (← links)
- Numerical results for spin glass ground states on Bethe lattices: Gaussian bonds (Q977517) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
- Boosting quantum annealer performance via sample persistence (Q1674555) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← 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)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Phase transition in a random NK landscape model (Q2389618) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- The asymptotics of the clustering transition for random constraint satisfaction problems (Q2659305) (← links)
- Critical behavior in the computational cost of satisfiability testing (Q2674189) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- Phase transitions of PP-complete satisfiability problems. (Abstract) (Q2741517) (← links)
- The phase transition in 1-in-\(k\) SAT and NAE 3-SAT (Q2768371) (← links)
- Coloring graphs using two colors while avoiding monochromatic cycles (Q2815462) (← links)
- On the Hardness of SAT with Community Structure (Q2818008) (← links)
- The large deviations of the whitening process in random constraint satisfaction problems (Q3302666) (← links)
- k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
- The phase transition in random horn satisfiability and its algorithmic implications (Q4543632) (← links)
- Random logic programs: Linear model (Q4593016) (← links)
- Phase transitions in the<i>q</i>-coloring of random hypergraphs (Q4602761) (← links)
- Biased landscapes for random constraint satisfaction problems (Q5006920) (← links)
- (Q5091218) (← links)
- Statistical and algebraic analysis of a family of random Boolean equations (Q5220530) (← links)
- A Model for Phase Transition of Random Answer-Set Programs (Q5277923) (← links)
- Biased measures for random constraint satisfaction problems: larger interaction range and asymptotic expansion (Q5857428) (← links)
- Statistical mechanics methods and phase transitions in optimization problems (Q5958800) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Lower bounds for random 3-SAT via differential equations (Q5958806) (← links)
- Frozen development in graph coloring (Q5958809) (← links)
- Bounding the scaling window of random constraint satisfaction problems (Q5963651) (← links)
