Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
Identifieur interne : 000C91 ( Istex/Checkpoint ); précédent : 000C90; suivant : 000C92Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
Auteurs : Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2000.
Abstract
Abstract: In this note we first formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are infinitely many propositional tautologies that are hard to prove in any sound propositional proof system.
Url:
DOI: 10.1007/3-540-46541-3_26
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:28874A2076C489F821A003B62EB091D49D9B5B73Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Nondeterministic Instance Complexity and Hard-to-Prove Tautologies</title><author><name sortKey="Arvind, Vikraman" sort="Arvind, Vikraman" uniqKey="Arvind V" first="Vikraman" last="Arvind">Vikraman Arvind</name></author><author><name sortKey="Kobler, Johannes" sort="Kobler, Johannes" uniqKey="Kobler J" first="Johannes" last="Köbler">Johannes Köbler</name></author><author><name sortKey="Mundhenk, Martin" sort="Mundhenk, Martin" uniqKey="Mundhenk M" first="Martin" last="Mundhenk">Martin Mundhenk</name></author><author><name sortKey="Toran, Jacobo" sort="Toran, Jacobo" uniqKey="Toran J" first="Jacobo" last="Torán">Jacobo Torán</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:28874A2076C489F821A003B62EB091D49D9B5B73</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1007/3-540-46541-3_26</idno><idno type="url">https://api.istex.fr/document/28874A2076C489F821A003B62EB091D49D9B5B73/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000D79</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000D79</idno><idno type="wicri:Area/Istex/Curation">000C69</idno><idno type="wicri:Area/Istex/Checkpoint">000C91</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C91</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Nondeterministic Instance Complexity and Hard-to-Prove Tautologies</title><author><name sortKey="Arvind, Vikraman" sort="Arvind, Vikraman" uniqKey="Arvind V" first="Vikraman" last="Arvind">Vikraman Arvind</name><affiliation wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>Institute of Mathematical Sciences, C.I.T Campus, 600113, Madras</wicri:regionArea><wicri:noRegion>Madras</wicri:noRegion></affiliation></author><author><name sortKey="Kobler, Johannes" sort="Kobler, Johannes" uniqKey="Kobler J" first="Johannes" last="Köbler">Johannes Köbler</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institut für Informatik, Humboldt-Universität zu Berlin, D-10099, Berlin</wicri:regionArea><placeName><settlement type="city">Berlin</settlement><region type="land" nuts="2">Berlin</region></placeName></affiliation></author><author><name sortKey="Mundhenk, Martin" sort="Mundhenk, Martin" uniqKey="Mundhenk M" first="Martin" last="Mundhenk">Martin Mundhenk</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV — Informatik, Universität Trier, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author><author><name sortKey="Toran, Jacobo" sort="Toran, Jacobo" uniqKey="Toran J" first="Jacobo" last="Torán">Jacobo Torán</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Theoretische Informatik, Universität Ulm, D-89069, Ulm</wicri:regionArea><placeName><region type="land" nuts="1">Bade-Wurtemberg</region><region type="district" nuts="2">District de Tübingen</region><settlement type="city">Ulm</settlement></placeName><orgName type="university">Université d'Ulm</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2000</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">28874A2076C489F821A003B62EB091D49D9B5B73</idno><idno type="DOI">10.1007/3-540-46541-3_26</idno><idno type="ChapterID">26</idno><idno type="ChapterID">Chap26</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this note we first formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are infinitely many propositional tautologies that are hard to prove in any sound propositional proof system.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Inde</li></country><region><li>Bade-Wurtemberg</li><li>Berlin</li><li>District de Tübingen</li></region><settlement><li>Berlin</li><li>Ulm</li></settlement><orgName><li>Université d'Ulm</li></orgName></list><tree><country name="Inde"><noRegion><name sortKey="Arvind, Vikraman" sort="Arvind, Vikraman" uniqKey="Arvind V" first="Vikraman" last="Arvind">Vikraman Arvind</name></noRegion></country><country name="Allemagne"><region name="Berlin"><name sortKey="Kobler, Johannes" sort="Kobler, Johannes" uniqKey="Kobler J" first="Johannes" last="Köbler">Johannes Köbler</name></region><name sortKey="Mundhenk, Martin" sort="Mundhenk, Martin" uniqKey="Mundhenk M" first="Martin" last="Mundhenk">Martin Mundhenk</name><name sortKey="Toran, Jacobo" sort="Toran, Jacobo" uniqKey="Toran J" first="Jacobo" last="Torán">Jacobo Torán</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C91 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000C91 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:28874A2076C489F821A003B62EB091D49D9B5B73
|texte= Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
}}
| This area was generated with Dilib version V0.6.31. |  |