Lower bounds for the majority communication complexity of various graph accessibility problems
Identifieur interne : 000E59 ( Istex/Corpus ); précédent : 000E58; suivant : 000E60Lower bounds for the majority communication complexity of various graph accessibility problems
Auteurs : C. Meinel ; S. WaackSource :
- Mathematical systems theory [ 0025-5661 ] ; 1996-12-01.
Abstract
Abstract: We investigate the probabilistic communication complexity (more exactly, the majority communication complexity), of the graph accessibility problem (GAP) and its counting versions MOD k -GAP,k ≥ 2. Due to arguments concerning matrix variation ranks and certain projection reductions, we prove that, for any partition of the input variables, GAP and MOD m -GAP have majority communication complexity Ω,(n), wheren denotes the number of nodes of the graph under consideration.
Url:
DOI: 10.1007/BF01301969
Links to Exploration step
ISTEX:124CE07576FB24F78DE893936DB7F0FBCD68C918Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Lower bounds for the majority communication complexity of various graph accessibility problems</title><author><name sortKey="Meinel, C" sort="Meinel, C" uniqKey="Meinel C" first="C." last="Meinel">C. Meinel</name><affiliation><mods:affiliation>Theoretische Informatik, Fachbereich IV, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation></author><author><name sortKey="Waack, S" sort="Waack, S" uniqKey="Waack S" first="S." last="Waack">S. Waack</name><affiliation><mods:affiliation>Institut für Numerisch und Angewandte Mathematik, Universität Göttingen, Lotzestrasse 16–18, D-37083, Gottingen, Germany</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:124CE07576FB24F78DE893936DB7F0FBCD68C918</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/BF01301969</idno><idno type="url">https://api.istex.fr/document/124CE07576FB24F78DE893936DB7F0FBCD68C918/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000E59</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000E59</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Lower bounds for the majority communication complexity of various graph accessibility problems</title><author><name sortKey="Meinel, C" sort="Meinel, C" uniqKey="Meinel C" first="C." last="Meinel">C. Meinel</name><affiliation><mods:affiliation>Theoretische Informatik, Fachbereich IV, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation></author><author><name sortKey="Waack, S" sort="Waack, S" uniqKey="Waack S" first="S." last="Waack">S. Waack</name><affiliation><mods:affiliation>Institut für Numerisch und Angewandte Mathematik, Universität Göttingen, Lotzestrasse 16–18, D-37083, Gottingen, Germany</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Mathematical systems theory</title><title level="j" type="abbrev">Math. Systems Theory</title><idno type="ISSN">0025-5661</idno><idno type="eISSN">1433-0490</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>New York</pubPlace><date type="published" when="1996-12-01">1996-12-01</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="649">649</biblScope><biblScope unit="page" to="659">659</biblScope></imprint><idno type="ISSN">0025-5661</idno></series><idno type="istex">124CE07576FB24F78DE893936DB7F0FBCD68C918</idno><idno type="DOI">10.1007/BF01301969</idno><idno type="ArticleID">BF01301969</idno><idno type="ArticleID">Art6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0025-5661</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We investigate the probabilistic communication complexity (more exactly, the majority communication complexity), of the graph accessibility problem (GAP) and its counting versions MOD k -GAP,k ≥ 2. Due to arguments concerning matrix variation ranks and certain projection reductions, we prove that, for any partition of the input variables, GAP and MOD m -GAP have majority communication complexity Ω,(n), wheren denotes the number of nodes of the graph under consideration.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>C. Meinel</name><affiliations><json:string>Theoretische Informatik, Fachbereich IV, Universität Trier, D-54286, Trier, Germany</json:string></affiliations></json:item><json:item><name>S. Waack</name><affiliations><json:string>Institut für Numerisch und Angewandte Mathematik, Universität Göttingen, Lotzestrasse 16–18, D-37083, Gottingen, Germany</json:string></affiliations></json:item></author><articleId><json:string>BF01301969</json:string><json:string>Art6</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: We investigate the probabilistic communication complexity (more exactly, the majority communication complexity), of the graph accessibility problem (GAP) and its counting versions MOD k -GAP,k ≥ 2. Due to arguments concerning matrix variation ranks and certain projection reductions, we prove that, for any partition of the input variables, GAP and MOD m -GAP have majority communication complexity Ω,(n), wheren denotes the number of nodes of the graph under consideration.</abstract><qualityIndicators><score>5.327</score><pdfVersion>1.3</pdfVersion><pdfPageSize>446.28 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>484</abstractCharCount><pdfWordCount>4487</pdfWordCount><pdfCharCount>20054</pdfCharCount><pdfPageCount>11</pdfPageCount><abstractWordCount>70</abstractWordCount></qualityIndicators><title>Lower bounds for the majority communication complexity of various graph accessibility problems</title><refBibs><json:item><author><json:item><name>A,V Aho</name></json:item><json:item><name>J,D Ullman</name></json:item><json:item><name>M Yannakakis</name></json:item></author><host><pages><last>183</last><first>133</first></pages><author></author><title>Proceedings of the 15th ACM STOC</title><publicationDate>1983</publicationDate></host><title>On notions of information transfer in VLSI circuits</title><publicationDate>1983</publicationDate></json:item><json:item><author><json:item><name>L Babai</name></json:item><json:item><name>P Frankl</name></json:item><json:item><name>J Simon</name></json:item></author><host><pages><last>347</last><first>337</first></pages><author></author><title>Proceedings of the 27th 1EEE FOCS</title><publicationDate>1986</publicationDate></host><title>Complexity classes in communication complexity theory</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>B Halstenberg</name></json:item><json:item><name>R Reischuk</name></json:item></author><host><pages><last>28</last><first>19</first></pages><author></author><title>Proceedings of the 3rd IEEE Structure in Complexity Theory Conference</title><publicationDate>1988</publicationDate></host><title>Relations between communication complexity classes</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>C Damm</name></json:item><json:item><name>M Krause</name></json:item><json:item><name> Ch</name></json:item><json:item><name>S,T Meinel</name></json:item><json:item><name> Waack</name></json:item></author><host><pages><last>293</last><first>281</first></pages><author></author><title>Proceedings of the 9th STACS</title><publicationDate>1992</publicationDate></host><title>Separating counting communication complexity classes</title><publicationDate>1992</publicationDate></json:item><json:item><author><json:item><name>A Hajnal</name></json:item><json:item><name>W Maass</name></json:item><json:item><name>G Turan</name></json:item></author><host><pages><last>191</last><first>186</first></pages><author></author><title>Proceedings of the 20th ACM STOC</title><publicationDate>1988</publicationDate></host><title>On the communication complexity of graph problems</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>N Immerman</name></json:item></author><host><volume>16</volume><pages><last>778</last><first>760</first></pages><issue>4</issue><author></author><title>SIAM Journal of Computing</title><publicationDate>1978</publicationDate></host><title>Languages that capture complexity classes</title><publicationDate>1978</publicationDate></json:item><json:item><author><json:item><name>M Kranse</name></json:item><json:item><name> St</name></json:item><json:item><name> Waack</name></json:item></author><host><pages><last>782</last><first>777</first></pages><author></author><title>Proceedings of the 32nd IEEE FOCS</title><publicationDate>1991</publicationDate></host><title>Variation ranks of communication matrices and lower bounds for depth, two circuits having symmetric gates with unbounded fan-in</title><publicationDate>1991</publicationDate></json:item><json:item><author><json:item><name> Ch</name></json:item></author><host><pages><last>535</last><first>527</first></pages><author></author><title>Proceedings of the 12th MFCS</title><publicationDate>1986</publicationDate></host><title>p-Projection reducibility and the complexity classes L(nonnniform) and NL(nonuniform)</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name> Ch</name></json:item><json:item><name> Meine@bullet</name></json:item></author><host><volume>370</volume><author></author><title>Lecture N@BULLETtes in C@BULLETmputer Science</title><publicationDate>1989</publicationDate></host><title>M@BULLETdi@BULLETed Branching Pr@BULLETgrams and Their C@BULLETmputati@BULLETnal P@BULLETwer</title><publicationDate>1989</publicationDate></json:item><json:item><host><pages><last>290</last><first>273</first></pages><author><json:item><name> Ch</name></json:item><json:item><name> Meinel</name></json:item><json:item><name> St</name></json:item><json:item><name> Waack</name></json:item></author><title>Upper and lower bounds for certain graph-accessibility problems on bounded alternating co-branching programs</title><publicationDate>1993</publicationDate></host></json:item><json:item><author><json:item><name> Ch</name></json:item><json:item><name> Meinel</name></json:item><json:item><name> St</name></json:item><json:item><name> Waack</name></json:item></author><host><pages><last>435</last><first>427</first></pages><author></author><title>Proceedings of the lATIN '95</title></host><title>Lower bounds on the modular communication complexity of various graphaccessibility problems</title></json:item><json:item><author><json:item><name>K Mehlhom</name></json:item><json:item><name>E,M Schmidt</name></json:item></author><host><pages><last>337</last><first>330</first></pages><author></author><title>Proceedings of the 14th ACM STOC</title><publicationDate>1982</publicationDate></host><title>Las Vegas is better than determinism in VLSI and distributed computing</title><publicationDate>1982</publicationDate></json:item><json:item><author><json:item><name>R Paturi</name></json:item><json:item><name>J Simon</name></json:item></author><host><volume>33</volume><pages><last>124</last><first>106</first></pages><author></author><title>Journal of Computer and System Science</title><publicationDate>1986</publicationDate></host><title>Probabilistic communication complexity</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>R Raz</name></json:item><json:item><name>B Spieker</name></json:item></author><host><pages><last>176</last><first>168</first></pages><author></author><title>Proceedings of the 34th IEEE FOCS</title><publicationDate>1993</publicationDate></host><title>On the "log rank"-conjecture in communication complexity</title><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>W Savitch</name></json:item></author><host><volume>4</volume><pages><last>253</last><first>244</first></pages><author></author><title>Journal of Computer and System Science</title><publicationDate>1970</publicationDate></host><title>Relationship between nondeterministic and deterministic tape complexities</title><publicationDate>1970</publicationDate></json:item><json:item><author><json:item><name>L,V Skyum</name></json:item><json:item><name> Valiant</name></json:item></author><host><pages><last>253</last><first>244</first></pages><author></author><title>Proceedings ofthe 22ndlEEE FOCS</title></host><title>A complexity theory based on Boolean algebra</title></json:item><json:item><author><json:item><name>A Yao</name></json:item></author><host><pages><last>311</last><first>308</first></pages><author></author><title>Proceedings of the 13th ACM STOC</title><publicationDate>1981</publicationDate></host><title>The entropic limitations of VLSI computations</title><publicationDate>1981</publicationDate></json:item></refBibs><genre><json:string>research-article</json:string></genre><host><volume>29</volume><pages><last>659</last><first>649</first></pages><issn><json:string>0025-5661</json:string></issn><issue>6</issue><subject><json:item><value>Computer Science</value></json:item><json:item><value>Theory of Computation</value></json:item><json:item><value>Computational Mathematics and Numerical Analysis</value></json:item></subject><journalId><json:string>224</json:string></journalId><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1433-0490</json:string></eissn><title>Mathematical systems theory</title><publicationDate>1996</publicationDate><copyrightDate>1996</copyrightDate></host><publicationDate>1996</publicationDate><copyrightDate>1996</copyrightDate><doi><json:string>10.1007/BF01301969</json:string></doi><id>124CE07576FB24F78DE893936DB7F0FBCD68C918</id><score>0.47684604</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/124CE07576FB24F78DE893936DB7F0FBCD68C918/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/124CE07576FB24F78DE893936DB7F0FBCD68C918/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/124CE07576FB24F78DE893936DB7F0FBCD68C918/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Lower bounds for the majority communication complexity of various graph accessibility problems</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-Verlag</publisher><pubPlace>New York</pubPlace><availability><p>Springer-Verlag New York Inc, 1996</p></availability><date>1994-05-15</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Lower bounds for the majority communication complexity of various graph accessibility problems</title><author xml:id="author-1"><persName><forename type="first">C.</forename><surname>Meinel</surname></persName><affiliation>Theoretische Informatik, Fachbereich IV, Universität Trier, D-54286, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">S.</forename><surname>Waack</surname></persName><affiliation>Institut für Numerisch und Angewandte Mathematik, Universität Göttingen, Lotzestrasse 16–18, D-37083, Gottingen, Germany</affiliation></author></analytic><monogr><title level="j">Mathematical systems theory</title><title level="j" type="abbrev">Math. Systems Theory</title><idno type="journal-ID">224</idno><idno type="pISSN">0025-5661</idno><idno type="eISSN">1433-0490</idno><idno type="issue-article-count">7</idno><idno type="volume-issue-count">6</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>New York</pubPlace><date type="published" when="1996-12-01"></date><biblScope unit="volume">29</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="649">649</biblScope><biblScope unit="page" to="659">659</biblScope></imprint></monogr><idno type="istex">124CE07576FB24F78DE893936DB7F0FBCD68C918</idno><idno type="DOI">10.1007/BF01301969</idno><idno type="ArticleID">BF01301969</idno><idno type="ArticleID">Art6</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1994-05-15</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: We investigate the probabilistic communication complexity (more exactly, the majority communication complexity), of the graph accessibility problem (GAP) and its counting versions MOD k -GAP,k ≥ 2. Due to arguments concerning matrix variation ranks and certain projection reductions, we prove that, for any partition of the input variables, GAP and MOD m -GAP have majority communication complexity Ω,(n), wheren denotes the number of nodes of the graph under consideration.</p></abstract><textClass><keywords scheme="Journal-Subject-Group"><list><label>I</label><label>I16005</label><label>M1400X</label><item><term>Computer Science</term></item><item><term>Theory of Computation</term></item><item><term>Computational Mathematics and Numerical Analysis</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1994-05-15">Created</change><change when="1996-12-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-21">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/124CE07576FB24F78DE893936DB7F0FBCD68C918/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-Verlag</PublisherName><PublisherLocation>New York</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>224</JournalID><JournalPrintISSN>0025-5661</JournalPrintISSN><JournalElectronicISSN>1433-0490</JournalElectronicISSN><JournalTitle>Mathematical systems theory</JournalTitle><JournalAbbreviatedTitle>Math. Systems Theory</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Code="I" Type="Primary">Computer Science</JournalSubject><JournalSubject Code="I16005" Priority="1" Type="Secondary">Theory of Computation</JournalSubject><JournalSubject Code="M1400X" Priority="2" Type="Secondary">Computational Mathematics and Numerical Analysis</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo TocLevels="0" VolumeType="Regular"><VolumeIDStart>29</VolumeIDStart><VolumeIDEnd>29</VolumeIDEnd><VolumeIssueCount>6</VolumeIssueCount></VolumeInfo><Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>6</IssueIDStart><IssueIDEnd>6</IssueIDEnd><IssueArticleCount>7</IssueArticleCount><IssueHistory><CoverDate><Year>1996</Year><Month>12</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1996</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art6"><ArticleInfo ArticleType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ArticleID>BF01301969</ArticleID><ArticleDOI>10.1007/BF01301969</ArticleDOI><ArticleSequenceNumber>6</ArticleSequenceNumber><ArticleTitle Language="En">Lower bounds for the majority communication complexity of various graph accessibility problems</ArticleTitle><ArticleFirstPage>649</ArticleFirstPage><ArticleLastPage>659</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2005</Year><Month>2</Month><Day>26</Day></RegistrationDate><Received><Year>1994</Year><Month>5</Month><Day>15</Day></Received><Revised><Year>1995</Year><Month>7</Month><Day>15</Day></Revised></ArticleHistory><ArticleCopyright><CopyrightHolderName>Springer-Verlag New York Inc</CopyrightHolderName><CopyrightYear>1996</CopyrightYear></ArticleCopyright><ArticleGrants 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></ArticleGrants> <ArticleContext><JournalID>224</JournalID><VolumeIDStart>29</VolumeIDStart><VolumeIDEnd>29</VolumeIDEnd><IssueIDStart>6</IssueIDStart><IssueIDEnd>6</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Meinel</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>S.</GivenName><FamilyName>Waack</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Theoretische Informatik, Fachbereich IV</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postcode>D-54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Institut für Numerisch und Angewandte Mathematik</OrgDivision><OrgName>Universität Göttingen</OrgName><OrgAddress><Street>Lotzestrasse 16–18</Street><Postcode>D-37083</Postcode><City>Gottingen</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We investigate the probabilistic communication complexity (more exactly, the majority communication complexity), of the graph accessibility problem (GAP) and its counting versions MOD<Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>-GAP,<Emphasis Type="Italic">k</Emphasis> ≥ 2. Due to arguments concerning matrix variation ranks and certain projection reductions, we prove that, for any partition of the input variables, GAP and MOD<Subscript><Emphasis Type="Italic">m</Emphasis></Subscript>-GAP have majority communication complexity Ω,(<Emphasis Type="Italic">n</Emphasis>), where<Emphasis Type="Italic">n</Emphasis> denotes the number of nodes of the graph under consideration.</Para></Abstract></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Lower bounds for the majority communication complexity of various graph accessibility problems</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Lower bounds for the majority communication complexity of various graph accessibility problems</title></titleInfo><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Meinel</namePart><affiliation>Theoretische Informatik, Fachbereich IV, Universität Trier, D-54286, Trier, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">S.</namePart><namePart type="family">Waack</namePart><affiliation>Institut für Numerisch und Angewandte Mathematik, Universität Göttingen, Lotzestrasse 16–18, D-37083, Gottingen, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer-Verlag</publisher><place><placeTerm type="text">New York</placeTerm></place><dateCreated encoding="w3cdtf">1994-05-15</dateCreated><dateIssued encoding="w3cdtf">1996-12-01</dateIssued><copyrightDate encoding="w3cdtf">1996</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: We investigate the probabilistic communication complexity (more exactly, the majority communication complexity), of the graph accessibility problem (GAP) and its counting versions MOD k -GAP,k ≥ 2. Due to arguments concerning matrix variation ranks and certain projection reductions, we prove that, for any partition of the input variables, GAP and MOD m -GAP have majority communication complexity Ω,(n), wheren denotes the number of nodes of the graph under consideration.</abstract><relatedItem type="host"><titleInfo><title>Mathematical systems theory</title></titleInfo><titleInfo type="abbreviated"><title>Math. Systems Theory</title></titleInfo><genre type="journal" displayLabel="Archive Journal"></genre><originInfo><dateIssued encoding="w3cdtf">1996-12-01</dateIssued><copyrightDate encoding="w3cdtf">1996</copyrightDate></originInfo><subject><genre>Journal-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16005">Theory of Computation</topic><topic authority="SpringerSubjectCodes" authorityURI="M1400X">Computational Mathematics and Numerical Analysis</topic></subject><identifier type="ISSN">0025-5661</identifier><identifier type="eISSN">1433-0490</identifier><identifier type="JournalID">224</identifier><identifier type="IssueArticleCount">7</identifier><identifier type="VolumeIssueCount">6</identifier><part><date>1996</date><detail type="volume"><number>29</number><caption>vol.</caption></detail><detail type="issue"><number>6</number><caption>no.</caption></detail><extent unit="pages"><start>649</start><end>659</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1996</recordOrigin></recordInfo></relatedItem><identifier type="istex">124CE07576FB24F78DE893936DB7F0FBCD68C918</identifier><identifier type="DOI">10.1007/BF01301969</identifier><identifier type="ArticleID">BF01301969</identifier><identifier type="ArticleID">Art6</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag New York Inc, 1996</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag New York Inc, 1996</recordOrigin></recordInfo></mods></metadata><serie></serie></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 000E59 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000E59 | 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:124CE07576FB24F78DE893936DB7F0FBCD68C918
|texte= Lower bounds for the majority communication complexity of various graph accessibility problems
}}
| This area was generated with Dilib version V0.6.31. |  |