Sciweavers

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

90

Voted

STOC
2001
ACM

161views Algorithms» more STOC 2001»

A sharp threshold in proof complexity

16 years 2 months ago

A sharp threshold in proof complexity

Download www.cs.washington.edu

Dimitris Achlioptas, Paul Beame, Michael S. O. Mol

Real-time Traffic

Algorithms | Sharp Threshold | STOC 2001 |

claim paper

Related Content

» Routing Information Protocol in HOLSPIN

» Hardness Amplification in Proof Complexity

» Constructive Proofs of Concentration Bounds

» Measuring Visual Threshold of Inkjet Banding

» On the Complexity of Linear Prediction Risk Bounds Margin Bounds and Regularization

» Improved Approximation of Linear Threshold Functions

» The Permanent Requires Large Uniform Threshold Circuits

» DistributionIndependent Evolvability of Linear Threshold Functions

» Extending precolorings to circular colorings

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2001
Where	STOC
Authors	Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy

Comments (0)