UnivTrevesV1, Main, Merge, bibRecord, 002331

Nondeterministic instance complexity and hard-to-prove tautologies

Identifieur interne : 002331 ( Main/Merge ); précédent : 002330; suivant : 002332

Nondeterministic instance complexity and hard-to-prove tautologies

Auteurs : V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne] ; J. Toran [Allemagne]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2000.

RBID : Pascal:00-0273011

Descripteurs français

Pascal (Inist)
- Informatique théorique, Problème NP difficile, Programmation logique, Logique propositionnelle, Complexité programme, Preuve programme, Complexité Kolmogorov.

English descriptors

KwdEn :
- Computer theory, Logical programming, NP hard problem, Program complexity, Program proof, Propositional logic.

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.

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000F36
to stream PascalFrancis, to step Curation: 000033
to stream PascalFrancis, to step Checkpoint: 000C85

Links to Exploration step

Pascal:00-0273011

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Nondeterministic instance complexity and hard-to-prove tautologies</title>
<author><name sortKey="Arvind, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Mathematical Sciences, C.I.T Campus</s1>
<s2>Madras 600113</s2>
<s3>IND</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Inde</country>
<wicri:noRegion>Madras 600113</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Humboldt-Universität zu Berlin, Institut für Informatik</s1>
<s2>10099 Berlin</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>10099 Berlin</wicri:noRegion>
<placeName><settlement type="city">Berlin</settlement>
<region type="land" nuts="2">Berlin</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Universität Trier, Fachbereich IV - Informatik</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<wicri:noRegion>Fachbereich IV - Informatik</wicri:noRegion>
<wicri:noRegion>54286 Trier</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Toran, J" sort="Toran, J" uniqKey="Toran J" first="J." last="Toran">J. Toran</name>
<affiliation wicri:level="4"><inist:fA14 i1="04"><s1>Universität Ulm, Theoretische Informatik</s1>
<s2>89069 Ulm</s2>
<s3>DEU</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<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>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0273011</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0273011 INIST</idno>
<idno type="RBID">Pascal:00-0273011</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000F36</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000033</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000C85</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C85</idno>
<idno type="wicri:doubleKey">0302-9743:2000:Arvind V:nondeterministic:instance:complexity</idno>
<idno type="wicri:Area/Main/Merge">002331</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Nondeterministic instance complexity and hard-to-prove tautologies</title>
<author><name sortKey="Arvind, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Mathematical Sciences, C.I.T Campus</s1>
<s2>Madras 600113</s2>
<s3>IND</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Inde</country>
<wicri:noRegion>Madras 600113</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Humboldt-Universität zu Berlin, Institut für Informatik</s1>
<s2>10099 Berlin</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>10099 Berlin</wicri:noRegion>
<placeName><settlement type="city">Berlin</settlement>
<region type="land" nuts="2">Berlin</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Universität Trier, Fachbereich IV - Informatik</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<wicri:noRegion>Fachbereich IV - Informatik</wicri:noRegion>
<wicri:noRegion>54286 Trier</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Toran, J" sort="Toran, J" uniqKey="Toran J" first="J." last="Toran">J. Toran</name>
<affiliation wicri:level="4"><inist:fA14 i1="04"><s1>Universität Ulm, Theoretische Informatik</s1>
<s2>89069 Ulm</s2>
<s3>DEU</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<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>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2000">2000</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term>
<term>Logical programming</term>
<term>NP hard problem</term>
<term>Program complexity</term>
<term>Program proof</term>
<term>Propositional logic</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Problème NP difficile</term>
<term>Programmation logique</term>
<term>Logique propositionnelle</term>
<term>Complexité programme</term>
<term>Preuve programme</term>
<term>Complexité Kolmogorov</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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, V" sort="Arvind, V" uniqKey="Arvind V" first="V." last="Arvind">V. Arvind</name>
</noRegion>
</country>
<country name="Allemagne"><region name="Berlin"><name sortKey="Kobler, J" sort="Kobler, J" uniqKey="Kobler J" first="J." last="Köbler">J. Köbler</name>
</region>
<name sortKey="Mundhenk, M" sort="Mundhenk, M" uniqKey="Mundhenk M" first="M." last="Mundhenk">M. Mundhenk</name>
<name sortKey="Toran, J" sort="Toran, J" uniqKey="Toran J" first="J." last="Toran">J. Toran</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002331 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002331 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     Pascal:00-0273011
   |texte=   Nondeterministic instance complexity and hard-to-prove tautologies
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

Nondeterministic instance complexity and hard-to-prove tautologies

Nondeterministic instance complexity and hard-to-prove tautologies

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri