Pages that link to "Item:Q5958805"
From MaRDI portal
The following pages link to Results related to threshold phenomena research in satisfiability: Lower bounds (Q5958805):
Displayed 13 items.
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← 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)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- On the freezing of variables in random constraint satisfaction problems (Q2473356) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- The large deviations of the whitening process in random constraint satisfaction problems (Q3302666) (← links)
- Phase transition of multivariate polynomial systems (Q3616213) (← links)
- Biased landscapes for random constraint satisfaction problems (Q5006920) (← 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)
- Lower bounds for random 3-SAT via differential equations (Q5958806) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems (Q5958810) (← links)