Separating complexity classes related to bounded alternating Ω-branching programs
Identifieur interne : 000A62 ( Istex/Corpus ); précédent : 000A61; suivant : 000A63Separating complexity classes related to bounded alternating Ω-branching programs
Auteurs : Christoph Meinel ; Stephan WaackSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1993.
Abstract
Abstract: By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating Ω-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes NL ba, co-NL ba, ⊕L ba, MOD p-L ba, p prime.
Url:
DOI: 10.1007/3-540-57568-5_269
Links to Exploration step
ISTEX:22914FF5BB96CE17760DBA987B9C35F06985DAE1Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Separating complexity classes related to bounded alternating Ω-branching programs</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation><mods:affiliation>FB IV-Informatik, Universität Trier, D-54286, Trier</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: meinel@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Waack, Stephan" sort="Waack, Stephan" uniqKey="Waack S" first="Stephan" last="Waack">Stephan Waack</name><affiliation><mods:affiliation>Inst. für Num. u. Angew. Mathematik, Georg-August-Universität, D-37083, Göttingen</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: waack@namu01.gwdg.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:22914FF5BB96CE17760DBA987B9C35F06985DAE1</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-57568-5_269</idno><idno type="url">https://api.istex.fr/document/22914FF5BB96CE17760DBA987B9C35F06985DAE1/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000A62</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000A62</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Separating complexity classes related to bounded alternating Ω-branching programs</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation><mods:affiliation>FB IV-Informatik, Universität Trier, D-54286, Trier</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: meinel@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Waack, Stephan" sort="Waack, Stephan" uniqKey="Waack S" first="Stephan" last="Waack">Stephan Waack</name><affiliation><mods:affiliation>Inst. für Num. u. Angew. Mathematik, Georg-August-Universität, D-37083, Göttingen</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: waack@namu01.gwdg.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1993</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">22914FF5BB96CE17760DBA987B9C35F06985DAE1</idno><idno type="DOI">10.1007/3-540-57568-5_269</idno><idno type="ChapterID">41</idno><idno type="ChapterID">Chap41</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: By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating Ω-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes NL ba, co-NL ba, ⊕L ba, MOD p-L ba, p prime.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Christoph Meinel</name><affiliations><json:string>FB IV-Informatik, Universität Trier, D-54286, Trier</json:string><json:string>E-mail: meinel@uni-trier.de</json:string></affiliations></json:item><json:item><name>Stephan Waack</name><affiliations><json:string>Inst. für Num. u. Angew. Mathematik, Georg-August-Universität, D-37083, Göttingen</json:string><json:string>E-mail: waack@namu01.gwdg.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating Ω-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes NL ba, co-NL ba, ⊕L ba, MOD p-L ba, p prime.</abstract><qualityIndicators><score>4.292</score><pdfVersion>1.3</pdfVersion><pdfPageSize>439.28 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>327</abstractCharCount><pdfWordCount>3680</pdfWordCount><pdfCharCount>18069</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>51</abstractWordCount></qualityIndicators><title>Separating complexity classes related to bounded alternating Ω-branching programs</title><chapterId><json:string>41</json:string><json:string>Chap41</json:string></chapterId><refBibs><json:item><author><json:item><name>N Alon</name></json:item><json:item><name>W </name></json:item></author><host><pages><last>39</last><first>30</first></pages><author></author><title>Proc. 27th ACM STOC</title><publicationDate>1986</publicationDate></host><title>Maass: Meanders, Ramsey theory and lower bounds</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>A Borodin</name></json:item><json:item><name>A Razborov</name></json:item><json:item><name>R Smolensky</name></json:item></author><host><volume>3</volume><pages><last>18</last><first>1</first></pages><author></author><title>Comput. Complexity</title><publicationDate>1993</publicationDate></host><title>On lower bounds for read-k times branching programs</title><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>D Damm</name></json:item><json:item><name>M Krause</name></json:item><json:item><name> Ch</name></json:item><json:item><name>S Meinel</name></json:item><json:item><name> Waack</name></json:item></author><host><pages><last>292</last><first>281</first></pages><author></author><title>Proc. STACS'92</title><publicationDate>1992</publicationDate></host><title>Separating Restricted MODv-Branching Program Classes</title><publicationDate>1992</publicationDate></json:item><json:item><author><json:item><name>M Krause</name></json:item><json:item><name> Ch</name></json:item><json:item><name>S Meinel</name></json:item><json:item><name> Waack</name></json:item></author><host><pages><last>259</last><first>240</first></pages><author></author><title>Proc. 4th IEEE Structure in Complexity Theory</title><publicationDate>1989</publicationDate></host><title>Separating Complexity Classes Related to Certain Input Oblivious Logarithmic Space Bounded Turing Machines</title><publicationDate>1989</publicationDate></json:item><json:item><author><json:item><name>M Krause</name></json:item></author><host><pages><last>391</last><first>385</first></pages><author></author><title>Proc. MFCS'90</title></host><title>Separating @/~ from s co-Af/~ and AL = P for Oblivious Turing Machines of Linear Access Time</title></json:item><json:item><author><json:item><name>C,Y </name></json:item></author><host><volume>38</volume><pages><last>999</last><first>985</first></pages><author></author><title>Bell System Techn. Journal</title><publicationDate>1959</publicationDate></host><title>Lee: Representation of Switching Functions by Binary Decision Programs</title><publicationDate>1959</publicationDate></json:item><json:item><author><json:item><name> Ch</name></json:item></author><host><pages><last>90</last><first>81</first></pages><author></author><title>Proc. STACS'88</title></host><title>Meinel: Polynomial Size O-Branching Programs and Their Computational Power</title></json:item><json:item><author><json:item><name> Ch</name></json:item></author><host><author></author><title>Modified Branching Programs and Their Computational Power</title><publicationDate>1989</publicationDate></host><publicationDate>1989</publicationDate></json:item><json:item><author><json:item><name> Ch</name></json:item><json:item><name>S Meinel</name></json:item><json:item><name> Waack</name></json:item></author><host><pages><last>345</last><first>337</first></pages><author></author><title>MFCS'91</title></host><title>Upper and Lower Bounds for Certain Graph- Accessibility-Problems on Bounded Alternating Branching Programs</title></json:item><json:item><host><author><json:item><name>P,S Pudls</name></json:item><json:item><name> Zak</name></json:item></author><title>Space Complexity of Computations</title><publicationDate>1983</publicationDate></host></json:item><json:item><author><json:item><name>S Zak</name></json:item></author><host><pages><last>566</last><first>562</first></pages><author></author><title>Proc. MFCS'84</title></host><title>An Exponential Lower Bound for One-Time-Only Branching Programs</title></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>1993</copyrightDate></serie><host><editor><json:item><name>K. W. Ng</name></json:item><json:item><name>P. Raghavan</name></json:item><json:item><name>N. V. Balasubramanian</name></json:item><json:item><name>F. Y. L. Chin</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Combinatorics</value></json:item><json:item><value>Probability Theory and Stochastic Processes</value></json:item><json:item><value>Statistics, general</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Computer Graphics</value></json:item></subject><isbn><json:string>978-3-540-57568-9</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Algorithms and Computation</title><bookId><json:string>3540575685</json:string></bookId><volume>762</volume><pages><last>388</last><first>379</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-48233-8</json:string></eisbn><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-57568-5</json:string></doi></host><publicationDate>2005</publicationDate><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-57568-5_269</json:string></doi><id>22914FF5BB96CE17760DBA987B9C35F06985DAE1</id><score>0.38777816</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/22914FF5BB96CE17760DBA987B9C35F06985DAE1/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/22914FF5BB96CE17760DBA987B9C35F06985DAE1/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/22914FF5BB96CE17760DBA987B9C35F06985DAE1/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Separating complexity classes related to bounded alternating Ω-branching programs</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag, 1993</p></availability><date>1993</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Separating complexity classes related to bounded alternating Ω-branching programs</title><author xml:id="author-1"><persName><forename type="first">Christoph</forename><surname>Meinel</surname></persName><email>meinel@uni-trier.de</email><affiliation>FB IV-Informatik, Universität Trier, D-54286, Trier</affiliation></author><author xml:id="author-2"><persName><forename type="first">Stephan</forename><surname>Waack</surname></persName><email>waack@namu01.gwdg.de</email><affiliation>Inst. für Num. u. Angew. Mathematik, Georg-August-Universität, D-37083, Göttingen</affiliation></author></analytic><monogr><title level="m">Algorithms and Computation</title><title level="m" type="sub">4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings</title><idno type="pISBN">978-3-540-57568-9</idno><idno type="eISBN">978-3-540-48233-8</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/3-540-57568-5</idno><idno type="book-ID">3540575685</idno><idno type="book-title-ID">39000</idno><idno type="book-volume-number">762</idno><idno type="book-chapter-count">57</idno><editor><persName><forename type="first">K.</forename><forename type="first">W.</forename><surname>Ng</surname></persName></editor><editor><persName><forename type="first">P.</forename><surname>Raghavan</surname></persName></editor><editor><persName><forename type="first">N.</forename><forename type="first">V.</forename><surname>Balasubramanian</surname></persName></editor><editor><persName><forename type="first">F.</forename><forename type="first">Y.</forename><forename type="first">L.</forename><surname>Chin</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005-06-01"></date><biblScope unit="volume">762</biblScope><biblScope unit="page" from="379">379</biblScope><biblScope unit="page" to="388">388</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><biblScope><date>1993</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">22914FF5BB96CE17760DBA987B9C35F06985DAE1</idno><idno type="DOI">10.1007/3-540-57568-5_269</idno><idno type="ChapterID">41</idno><idno type="ChapterID">Chap41</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1993</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating Ω-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes NL ba, co-NL ba, ⊕L ba, MOD p-L ba, p prime.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16013</label><label>M17009</label><label>M27004</label><label>S0000X</label><label>I18032</label><label>I22013</label><item><term>Computer Science</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Combinatorics</term></item><item><term>Probability Theory and Stochastic Processes</term></item><item><term>Statistics, general</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Computer Graphics</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005-06-01">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/22914FF5BB96CE17760DBA987B9C35F06985DAE1/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540575685</BookID><BookTitle>Algorithms and Computation</BookTitle><BookSubTitle>4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings</BookSubTitle><BookVolumeNumber>762</BookVolumeNumber><BookDOI>10.1007/3-540-57568-5</BookDOI><BookTitleID>39000</BookTitleID><BookPrintISBN>978-3-540-57568-9</BookPrintISBN><BookElectronicISBN>978-3-540-48233-8</BookElectronicISBN><BookChapterCount>57</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="M17009" Priority="2" Type="Secondary">Combinatorics</BookSubject><BookSubject Code="M27004" Priority="3" Type="Secondary">Probability Theory and Stochastic Processes</BookSubject><BookSubject Code="S0000X" Priority="4" Type="Secondary">Statistics, general</BookSubject><BookSubject Code="I18032" Priority="5" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I22013" Priority="6" Type="Secondary">Computer Graphics</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>K.</GivenName><GivenName>W.</GivenName><FamilyName>Ng</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Raghavan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>N.</GivenName><GivenName>V.</GivenName><FamilyName>Balasubramanian</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>F.</GivenName><GivenName>Y.</GivenName><GivenName>L.</GivenName><FamilyName>Chin</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap41" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>41</ChapterID><ChapterDOI>10.1007/3-540-57568-5_269</ChapterDOI><ChapterSequenceNumber>41</ChapterSequenceNumber><ChapterTitle Language="En">Separating complexity classes related to bounded alternating Ω-branching programs</ChapterTitle><ChapterFirstPage>379</ChapterFirstPage><ChapterLastPage>388</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>1</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540575685</BookID><BookTitle>Algorithms and Computation</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Christoph</GivenName><FamilyName>Meinel</FamilyName></AuthorName><Contact><Email>meinel@uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Stephan</GivenName><FamilyName>Waack</FamilyName></AuthorName><Contact><Email>waack@namu01.gwdg.de</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>FB IV-Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postcode>D-54286</Postcode><City>Trier</City></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Inst. für Num. u. Angew. Mathematik</OrgDivision><OrgName>Georg-August-Universität</OrgName><OrgAddress><Postcode>D-37083</Postcode><City>Göttingen</City></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating <Emphasis Type="Italic">Ω</Emphasis>-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes <Emphasis Type="Italic">NL</Emphasis><Subscript>ba</Subscript>, <Emphasis Type="Italic">co-NL</Emphasis><Subscript>ba</Subscript>, ⊕<Emphasis Type="Italic">L</Emphasis><Subscript>ba</Subscript>, <Emphasis Type="Italic">MOD</Emphasis><Subscript>p</Subscript>-<Emphasis Type="Italic">L</Emphasis><Subscript>ba</Subscript>, <Emphasis Type="Italic">p</Emphasis> prime.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Separating complexity classes related to bounded alternating Ω-branching programs</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Separating complexity classes related to bounded alternating Ω-branching programs</title></titleInfo><name type="personal"><namePart type="given">Christoph</namePart><namePart type="family">Meinel</namePart><affiliation>FB IV-Informatik, Universität Trier, D-54286, Trier</affiliation><affiliation>E-mail: meinel@uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Stephan</namePart><namePart type="family">Waack</namePart><affiliation>Inst. für Num. u. Angew. Mathematik, Georg-August-Universität, D-37083, Göttingen</affiliation><affiliation>E-mail: waack@namu01.gwdg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005-06-01</dateIssued><copyrightDate encoding="w3cdtf">1993</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating Ω-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes NL ba, co-NL ba, ⊕L ba, MOD p-L ba, p prime.</abstract><relatedItem type="host"><titleInfo><title>Algorithms and Computation</title><subTitle>4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">K.</namePart><namePart type="given">W.</namePart><namePart type="family">Ng</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Raghavan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">N.</namePart><namePart type="given">V.</namePart><namePart type="family">Balasubramanian</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">F.</namePart><namePart type="given">Y.</namePart><namePart type="given">L.</namePart><namePart type="family">Chin</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">1993</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic><topic authority="SpringerSubjectCodes" authorityURI="M27004">Probability Theory and Stochastic Processes</topic><topic authority="SpringerSubjectCodes" authorityURI="S0000X">Statistics, general</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic></subject><identifier type="DOI">10.1007/3-540-57568-5</identifier><identifier type="ISBN">978-3-540-57568-9</identifier><identifier type="eISBN">978-3-540-48233-8</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">39000</identifier><identifier type="BookID">3540575685</identifier><identifier type="BookChapterCount">57</identifier><identifier type="BookVolumeNumber">762</identifier><part><date>1993</date><detail type="volume"><number>762</number><caption>vol.</caption></detail><extent unit="pages"><start>379</start><end>388</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1993</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1993</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1993</recordOrigin></recordInfo></relatedItem><identifier type="istex">22914FF5BB96CE17760DBA987B9C35F06985DAE1</identifier><identifier type="DOI">10.1007/3-540-57568-5_269</identifier><identifier type="ChapterID">41</identifier><identifier type="ChapterID">Chap41</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1993</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1993</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A62 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000A62 | 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= Corpus
|type= RBID
|clé= ISTEX:22914FF5BB96CE17760DBA987B9C35F06985DAE1
|texte= Separating complexity classes related to bounded alternating Ω-branching programs
}}
| This area was generated with Dilib version V0.6.31. |  |