Sciweavers

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

50

MFCS
1998
Springer

favoriteEmaildiscussreport

89views Theoretical Computer Science» more MFCS 1998»

Minimum Propositional Proof Length is NP-Hard to Linearly Approximate

15 years 1 months ago

Minimum Propositional Proof Length is NP-Hard to Linearly Approximate

Download math.ucsd.edu

Michael Alekhnovich, Samuel R. Buss, Shlomo Moran,

Real-time Traffic

MFCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Hardness of Approximating the Minimum Distance of a Linear Code

» Taming Numbers and Durations in the Model Checking Integrated Planning System

» Linguistic summarization of time series using a fuzzy quantifier driven aggregation

» Minimumcost coverage of point sets by disks

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	MFCS
Authors	Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi

Comments (0)