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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
140
click to vote
LATA
2009
Springer
102
views
Artificial Intelligence
»
more
LATA 2009
»
Nondeterministic Instance Complexity and Proof Systems with Advice
15 years 9 months ago
Download
www.informatik.hu-berlin.de
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
Olaf Beyersdorff, Johannes Köbler, Sebastian ...
claim paper
Read More »