Pages that link to "Item:Q2674184"
From MaRDI portal
The following pages link to Hard random 3-SAT problems and the Davis-Putnam procedure (Q2674184):
Displaying 10 items.
- Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
- A prover dealing with nominals, binders, transitivity and relation hierarchies (Q2303237) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)
- Computationally hard problems: 3-SAT and its polynomial solvability (Q2888335) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)
- AI 2003: Advances in Artificial Intelligence (Q5191583) (← links)
- Computer Science Logic (Q5311247) (← links)
- Reductions for non-clausal theorem proving (Q5958754) (← links)