Sciweavers

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

23

CSL
2008
Springer

favoriteEmaildiscussreport

80views Automated Reasoning» more CSL 2008»

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

13 years 10 months ago

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

Download tocl.acm.org

Olaf Beyersdorff, Sebastian Müller

Real-time Traffic

Automated Reasoning | CSL 2008 |

claim paper

Related Content

» Nondeterministic Instance Complexity and Proof Systems with Advice

» The Complexity of Model Checking Collapsible HigherOrder Pushdown Systems

» Tight Lower Bounds for Certain Parameterized NPHard Problems

» Satisfiability Allows No Nontrivial Sparsification Unless The PolynomialTime Hierarchy Col...

» Analysis of Hybrid Systems Using HySAT

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» On Spectral Learning of Mixtures of Distributions

» Assisted verification of elementary functions using Gappa

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CSL
Authors	Olaf Beyersdorff, Sebastian Müller

Comments (0)