Sciweavers

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

87

Voted

RSA
1998

49views more RSA 1998»

Approximating the unsatisfiability threshold of random formulas

15 years 2 months ago

Approximating the unsatisfiability threshold of random formulas

Download lca.ceid.upatras.gr

Lefteris M. Kirousis, Evangelos Kranakis, Danny Kr

Real-time Traffic

RSA 1998 |

claim paper

Related Content

» Structure of random rSAT below the pure literal threshold

» Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Paramete...

» Counting good truth assignments of random kSAT formulae

» Hardness Amplification in Proof Complexity

» Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	RSA
Authors	Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou

Comments (0)