The following pages link to The state of SAT (Q2643296):
Displaying 12 items.
- SAT race 2015 (Q334795) (← links)
- A study of heuristic guesses for adiabatic quantum computation (Q632202) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- On the refutational completeness of signed binary resolution and hyperresolution (Q1037933) (← links)
- Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479) (Q1961443) (← links)
- Popularity-similarity random SAT formulas (Q2238712) (← links)
- Solving SAT in a distributed cloud: a portfolio approach (Q2299084) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- A Bayesian approach to tackling hard computational problems. (Preliminary report) (Q2741540) (← links)
- SATLIB: An online resource for research on SAT (Q2749862) (← links)
- (Q5687266) (← links)
- Accelerating a continuous-time analog SAT solver using GPUs (Q6040130) (← links)