Searching for "On Random 3-sat." – sorted by Relevance.
-
Algorithms for random 3-SAT
- Algorithms for Random 3-SAT Abraham D. Flaxman, Microsoft Research INDEX TERMS: Satisfiability
- Cited by 1 (1 self) – Add To MetaCart
-
Random 3-SAT: The Plot Thickens
- Random 3-SAT: The Plot Thickens Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel
- Cited by 19 (2 self) – Add To MetaCart
-
Random 3-SAT: The Plot Thickens
- Random 3-SAT: The Plot Thickens Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel
- Add To MetaCart
-
Random 3-SAT and BDDs: The Plot Thickens Further
- Random 3-SAT and BDDs: The Plot Thickens Further Alfonso San Miguel Aguirre 1? and Moshe Y
- Cited by 14 (6 self) – Add To MetaCart
-
Implicates and Prime Implicates in Random 3SAT
- Implicates and Prime Implicates in Random 3SAT Robert Schrag Department of Computer Sciences
- Cited by 18 (0 self) – Add To MetaCart
-
Optimal myopic algorithms for random 3-SAT
- Optimal myopic algorithms for random 3-SAT Dimitris Achlioptas Microsoft Research One Microsoft Way
- Cited by 54 (8 self) – Add To MetaCart
-
Typical Random 3-SAT Formulae and the Satisfiability Threshold
- Typical Random 3-SAT Formulae and the Satisfiability Threshold O. Dubois 1 , Y. Boufkhad 2
- Cited by 65 (1 self) – Add To MetaCart
-
Experimental Results on the Crossover Point in Random 3sat
- Experimental Results on the Crossover Point in Random 3SAT James M. Crawford Computational
- Cited by 116 (5 self) – Add To MetaCart
-
The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
- The Satisability Threshold of Random 3-SAT Is at Least 3.52 MohammadTaghi Hajiaghayi Gregory B
- Cited by 17 (1 self) – Add To MetaCart
-
Why a Random 3-SAT Problem is Harder Than Another?
- Why a Random 3-SAT Problem is Harder Than Another? Chu Min Li & Anbulagan LaRIA, Universite de
- Add To MetaCart

