Sciweavers

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

101

STOC
1996
ACM

125views Algorithms» more STOC 1996»

Modular Coloring Formulas Are Hard for Cutting Planes Proofs

15 years 7 months ago

Modular Coloring Formulas Are Hard for Cutting Planes Proofs

Download www.cs.helsinki.fi

Xudong Fu

Real-time Traffic

Algorithms | STOC 1996 |

claim paper

Related Content

» Hardness Amplification in Proof Complexity

» New Inference Rules for MaxSAT

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1996
Where	STOC
Authors	Xudong Fu

Comments (0)