Pages that link to "Item:Q5958803"
From MaRDI portal
The following pages link to Rigorous results for random (\(2+p)\)-SAT (Q5958803):
Displayed 20 items.
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- On the thresholds in linear and nonlinear Boolean equations (Q614622) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
- Structure of large random hypergraphs (Q1774214) (← 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)
- Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
- Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities (Q2211648) (← links)
- Super solutions of random \((3 + p)\)-SAT (Q2326395) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Resolution complexity of random constraint satisfaction problems: Another half of the story (Q2581550) (← links)
- The state of SAT (Q2643296) (← links)
- GD-SAT model and crossover line (Q4784347) (← links)
- (Q5091218) (← links)
- Statistical and algebraic analysis of a family of random Boolean equations (Q5220530) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT (Q5384461) (← links)
- A NEW UPPER BOUND FOR RANDOM (2 + <i>p</i>)-SAT BY FLIPPING TWO VARIABLES (Q5401563) (← links)