Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
CSL
2008
Springer
favorite
Email
discuss
report
80
views
Automated Reasoning
»
more
CSL 2008
»
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
13 years 10 months ago
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
more »
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)
Researcher Info
Automated Reasoning Study Group
Computer Vision