On extracting computations from propositional proofs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F10%3A00422140" target="_blank" >RIV/67985840:_____/10:00422140 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.30" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.30</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.30" target="_blank" >10.4230/LIPIcs.FSTTCS.2010.30</a>
Alternative languages
Result language
angličtina
Original language name
On extracting computations from propositional proofs
Original language description
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of functions associated with the tautologies. Such bounds can potentially be usedto prove (conditional or unconditional) lower bounds on the lengths of proofs of these tautologies and show separations of some weak proof systems. The prototype are the results showing the feasible interpolation property for resolution. In order to prove similar results for systems stronger than resolution one needs to define suitable generalizations of boolean circuits. We will survey the known results concerning this project and sketch in which direction we want to generalize them.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
ISBN
978-3-939897-23-1
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
30-41
Publisher name
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
Place of publication
Wadem
Event location
Chennai
Event date
Dec 15, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000310361000003