On P versus NP∩co-NP for decision trees and read-once branching programs
Identifieur interne : 002474 ( Main/Curation ); précédent : 002473; suivant : 002475On P versus NP∩co-NP for decision trees and read-once branching programs
Auteurs : S. Jukna [Allemagne] ; A. Razborov [Russie, Cuba] ; P. Savick [République tchèque, Swaziland] ; I. Wegener [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1997.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
Abstract: It is known that if a Boolean function f in n variables has a DNF and a CNF of size ≤ N then f also has a (deterministic) decision tree of size exp(O(log n log2 N)). We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require deterministic trees of size exp (Ω(log2 N)) where N is the total number of monomials in minimal DNFs for f and -f. Moreover, we exhibit new examples of explicit Boolean functions that require deterministic read-once branching programs of exponential size whereas both the functions and their negations have small nondeterministic read-once branching programs. One example results from the Bruen-Blokhuis bound on the size of nontrivial blocking sets in projective planes: it is remarkably simple and combinatorially clear. Whereas other examples have the additional property that f is in AC°.
Url:
DOI: 10.1007/BFb0029975
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001463
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001351
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000F46
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002909
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001360
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :001632
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001031
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002A13
Links to Exploration step
ISTEX:278B80A20CF16EC1AF26906B6DE75764480D29EFLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On P versus NP∩co-NP for decision trees and read-once branching programs</title>
<author><name sortKey="Jukna, S" sort="Jukna, S" uniqKey="Jukna S" first="S." last="Jukna">S. Jukna</name>
</author>
<author><name sortKey="Razborov, A" sort="Razborov, A" uniqKey="Razborov A" first="A." last="Razborov">A. Razborov</name>
</author>
<author><name sortKey="Savick, P" sort="Savick, P" uniqKey="Savick P" first="P." last="Savick">P. Savick</name>
</author>
<author><name sortKey="Wegener, I" sort="Wegener, I" uniqKey="Wegener I" first="I." last="Wegener">I. Wegener</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:278B80A20CF16EC1AF26906B6DE75764480D29EF</idno>
<date when="1997" year="1997">1997</date>
<idno type="doi">10.1007/BFb0029975</idno>
<idno type="url">https://api.istex.fr/document/278B80A20CF16EC1AF26906B6DE75764480D29EF/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001463</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001463</idno>
<idno type="wicri:Area/Istex/Curation">001351</idno>
<idno type="wicri:Area/Istex/Checkpoint">000F46</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F46</idno>
<idno type="wicri:doubleKey">0302-9743:1997:Jukna S:on:p:versus</idno>
<idno type="wicri:Area/Main/Merge">002909</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:97-0493796</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001360</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001632</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">001031</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001031</idno>
<idno type="wicri:doubleKey">0302-9743:1997:Jukna S:on:p:versus</idno>
<idno type="wicri:Area/Main/Merge">002A13</idno>
<idno type="wicri:Area/Main/Curation">002474</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On P versus NP∩co-NP for decision trees and read-once branching programs</title>
<author><name sortKey="Jukna, S" sort="Jukna, S" uniqKey="Jukna S" first="S." last="Jukna">S. Jukna</name>
<affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Dept. of Computer Science, University of Trier, D-54286, Trier</wicri:regionArea>
<orgName type="university">Université de Trèves</orgName>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Razborov, A" sort="Razborov, A" uniqKey="Razborov A" first="A." last="Razborov">A. Razborov</name>
<affiliation wicri:level="3"><country xml:lang="fr">Russie</country>
<wicri:regionArea>Steklov Mathematical Institute, Gubkina 8, 117966, Moscow</wicri:regionArea>
<placeName><settlement type="city">Moscou</settlement>
<region>District fédéral central</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Cuba</country>
</affiliation>
</author>
<author><name sortKey="Savick, P" sort="Savick, P" uniqKey="Savick P" first="P." last="Savick">P. Savick</name>
<affiliation wicri:level="1"><country xml:lang="fr">République tchèque</country>
<wicri:regionArea>Acad. of Sci. of Czech Republic, Institute of Computer Science, Pod vodárenskou věží 2, 182 07, Praha 8</wicri:regionArea>
<placeName><settlement type="city">Prague</settlement>
<region type="région" nuts="2">Bohême centrale</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Swaziland</country>
</affiliation>
</author>
<author><name sortKey="Wegener, I" sort="Wegener, I" uniqKey="Wegener I" first="I." last="Wegener">I. Wegener</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Dept. of Computer Science, University of Dortmund, D-44221, Dortmund</wicri:regionArea>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District d'Arnsberg</region>
<settlement type="city">Dortmund</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>1997</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">278B80A20CF16EC1AF26906B6DE75764480D29EF</idno>
<idno type="DOI">10.1007/BFb0029975</idno>
<idno type="ChapterID">32</idno>
<idno type="ChapterID">Chap32</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Boolean function</term>
<term>Computational complexity</term>
<term>Computer theory</term>
<term>Decision tree</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Arbre décision</term>
<term>Complexité calcul</term>
<term>Fonction booléenne</term>
<term>Informatique théorique</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: It is known that if a Boolean function f in n variables has a DNF and a CNF of size ≤ N then f also has a (deterministic) decision tree of size exp(O(log n log2 N)). We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require deterministic trees of size exp (Ω(log2 N)) where N is the total number of monomials in minimal DNFs for f and -f. Moreover, we exhibit new examples of explicit Boolean functions that require deterministic read-once branching programs of exponential size whereas both the functions and their negations have small nondeterministic read-once branching programs. One example results from the Bruen-Blokhuis bound on the size of nontrivial blocking sets in projective planes: it is remarkably simple and combinatorially clear. Whereas other examples have the additional property that f is in AC°.</div>
</front>
</TEI>
<double idat="0302-9743:1997:Jukna S:on:p:versus"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On P versus NP∩co-NP for decision trees and read-once branching programs</title>
<author><name sortKey="Jukna, S" sort="Jukna, S" uniqKey="Jukna S" first="S." last="Jukna">S. Jukna</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Dept. of Computer Science, University of Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
<author><name sortKey="Razborov, A" sort="Razborov, A" uniqKey="Razborov A" first="A." last="Razborov">A. Razborov</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Steklov Mathematical Institute, Gubkina 8</s1>
<s2>117966, Moscow</s2>
<s3>RUS</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Russie</country>
<placeName><settlement type="city">Moscou</settlement>
<region>District fédéral central</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Savicky, P" sort="Savicky, P" uniqKey="Savicky P" first="P." last="Savicky">P. Savicky</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Institute of Computer Science. Acad. of Sci. of Czech Republic. Pod vodárenskou vezi 2</s1>
<s2>182 07 Praha</s2>
<s3>CZE</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>République tchèque</country>
<wicri:noRegion>Institute of Computer Science. Acad. of Sci. of Czech Republic. Pod vodárenskou vezi 2</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Wegener, I" sort="Wegener, I" uniqKey="Wegener I" first="I." last="Wegener">I. Wegener</name>
<affiliation wicri:level="3"><inist:fA14 i1="04"><s1>Dept. of Computer Science. University of Dortmund</s1>
<s2>44221 Dortmund</s2>
<s3>DEU</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District d'Arnsberg</region>
<settlement type="city">Dortmund</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">97-0493796</idno>
<date when="1997">1997</date>
<idno type="stanalyst">PASCAL 97-0493796 INIST</idno>
<idno type="RBID">Pascal:97-0493796</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001360</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001632</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">001031</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001031</idno>
<idno type="wicri:doubleKey">0302-9743:1997:Jukna S:on:p:versus</idno>
<idno type="wicri:Area/Main/Merge">002A13</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On P versus NP∩co-NP for decision trees and read-once branching programs</title>
<author><name sortKey="Jukna, S" sort="Jukna, S" uniqKey="Jukna S" first="S." last="Jukna">S. Jukna</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Dept. of Computer Science, University of Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
<author><name sortKey="Razborov, A" sort="Razborov, A" uniqKey="Razborov A" first="A." last="Razborov">A. Razborov</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Steklov Mathematical Institute, Gubkina 8</s1>
<s2>117966, Moscow</s2>
<s3>RUS</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Russie</country>
<placeName><settlement type="city">Moscou</settlement>
<region>District fédéral central</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Savicky, P" sort="Savicky, P" uniqKey="Savicky P" first="P." last="Savicky">P. Savicky</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Institute of Computer Science. Acad. of Sci. of Czech Republic. Pod vodárenskou vezi 2</s1>
<s2>182 07 Praha</s2>
<s3>CZE</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>République tchèque</country>
<wicri:noRegion>Institute of Computer Science. Acad. of Sci. of Czech Republic. Pod vodárenskou vezi 2</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Wegener, I" sort="Wegener, I" uniqKey="Wegener I" first="I." last="Wegener">I. Wegener</name>
<affiliation wicri:level="3"><inist:fA14 i1="04"><s1>Dept. of Computer Science. University of Dortmund</s1>
<s2>44221 Dortmund</s2>
<s3>DEU</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District d'Arnsberg</region>
<settlement type="city">Dortmund</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1997">1997</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>Boolean function</term>
<term>Computational complexity</term>
<term>Computer theory</term>
<term>Decision tree</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Fonction booléenne</term>
<term>Arbre décision</term>
<term>Complexité calcul</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">It is known that if a Boolean function f in n variables has a DNF and a CNF of size < N then f also has a (deterministic) decision tree of size exp (O(log n log<sup>2</sup>
N)). We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require deterministic trees of size exp (Ω(log<sup>2</sup>
N)) where N is the total number of monomials in minimal DNFs for and -f. Moreover, we exhibit new examples of explicit Boolean functions that require deterministic read-once branching programs of exponential size whereas both the functions and their negations have small nondeterministic read-once branching programs. One example results from the Bruen-Blokhuis bound on the size of nontrivial blocking sets in projective planes: it is remarkably simple and combinatorially clear. Whereas other examples have the additional property that is in AC°.</div>
</front>
</TEI>
</INIST>
<ISTEX><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On P versus NP∩co-NP for decision trees and read-once branching programs</title>
<author><name sortKey="Jukna, S" sort="Jukna, S" uniqKey="Jukna S" first="S." last="Jukna">S. Jukna</name>
</author>
<author><name sortKey="Razborov, A" sort="Razborov, A" uniqKey="Razborov A" first="A." last="Razborov">A. Razborov</name>
</author>
<author><name sortKey="Savick, P" sort="Savick, P" uniqKey="Savick P" first="P." last="Savick">P. Savick</name>
</author>
<author><name sortKey="Wegener, I" sort="Wegener, I" uniqKey="Wegener I" first="I." last="Wegener">I. Wegener</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:278B80A20CF16EC1AF26906B6DE75764480D29EF</idno>
<date when="1997" year="1997">1997</date>
<idno type="doi">10.1007/BFb0029975</idno>
<idno type="url">https://api.istex.fr/document/278B80A20CF16EC1AF26906B6DE75764480D29EF/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001463</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001463</idno>
<idno type="wicri:Area/Istex/Curation">001351</idno>
<idno type="wicri:Area/Istex/Checkpoint">000F46</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F46</idno>
<idno type="wicri:doubleKey">0302-9743:1997:Jukna S:on:p:versus</idno>
<idno type="wicri:Area/Main/Merge">002909</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On P versus NP∩co-NP for decision trees and read-once branching programs</title>
<author><name sortKey="Jukna, S" sort="Jukna, S" uniqKey="Jukna S" first="S." last="Jukna">S. Jukna</name>
<affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Dept. of Computer Science, University of Trier, D-54286, Trier</wicri:regionArea>
<orgName type="university">Université de Trèves</orgName>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Razborov, A" sort="Razborov, A" uniqKey="Razborov A" first="A." last="Razborov">A. Razborov</name>
<affiliation wicri:level="3"><country xml:lang="fr">Russie</country>
<wicri:regionArea>Steklov Mathematical Institute, Gubkina 8, 117966, Moscow</wicri:regionArea>
<placeName><settlement type="city">Moscou</settlement>
<region>District fédéral central</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Cuba</country>
</affiliation>
</author>
<author><name sortKey="Savick, P" sort="Savick, P" uniqKey="Savick P" first="P." last="Savick">P. Savick</name>
<affiliation wicri:level="1"><country xml:lang="fr">République tchèque</country>
<wicri:regionArea>Acad. of Sci. of Czech Republic, Institute of Computer Science, Pod vodárenskou věží 2, 182 07, Praha 8</wicri:regionArea>
<placeName><settlement type="city">Prague</settlement>
<region type="région" nuts="2">Bohême centrale</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Swaziland</country>
</affiliation>
</author>
<author><name sortKey="Wegener, I" sort="Wegener, I" uniqKey="Wegener I" first="I." last="Wegener">I. Wegener</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Dept. of Computer Science, University of Dortmund, D-44221, Dortmund</wicri:regionArea>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District d'Arnsberg</region>
<settlement type="city">Dortmund</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>1997</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">278B80A20CF16EC1AF26906B6DE75764480D29EF</idno>
<idno type="DOI">10.1007/BFb0029975</idno>
<idno type="ChapterID">32</idno>
<idno type="ChapterID">Chap32</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: It is known that if a Boolean function f in n variables has a DNF and a CNF of size ≤ N then f also has a (deterministic) decision tree of size exp(O(log n log2 N)). We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require deterministic trees of size exp (Ω(log2 N)) where N is the total number of monomials in minimal DNFs for f and -f. Moreover, we exhibit new examples of explicit Boolean functions that require deterministic read-once branching programs of exponential size whereas both the functions and their negations have small nondeterministic read-once branching programs. One example results from the Bruen-Blokhuis bound on the size of nontrivial blocking sets in projective planes: it is remarkably simple and combinatorially clear. Whereas other examples have the additional property that f is in AC°.</div>
</front>
</TEI>
</ISTEX>
</double>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002474 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 002474 | 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= Curation |type= RBID |clé= ISTEX:278B80A20CF16EC1AF26906B6DE75764480D29EF |texte= On P versus NP∩co-NP for decision trees and read-once branching programs }}
This area was generated with Dilib version V0.6.31. |