Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

126

Voted

CORR
2008
Springer

74views Education» more CORR 2008»

On the random satisfiable process

15 years 2 months ago

On the random satisfiable process

Download www.math.tau.ac.il

In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas

Michael Krivelevich, Benny Sudakov, Dan Vilenchik

Real-time Traffic

CORR 2008 | Education | Formulas | Satisfiable K-CNF Formulas | Satisfying Assignment |

claim paper

Related Content

» Delaying Satisfiability for Random 2SAT

» Stable manifold embeddings with operators satisfying the Restricted Isometry Property

» Generalized Restricted Isometry Property for alphastable random projections

» Satisfying Test Preconditions through Guided Object Selection

» Hidden Gold in Random Generation of SAT Satisfiable Instances

» Using Randomization and Learning to Solve Hard RealWorld Instances of Satisfiability

» Satisfying Assignments of Random Boolean Constraint Satisfaction Problems Clusters and Ove...

» A spectral technique for random satisfiable 3CNF formulas

» The satisfiability threshold for randomly generated binary constraint satisfaction problem...

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Michael Krivelevich, Benny Sudakov, Dan Vilenchik

Comments (0)