Lower bounds for the modular communication complexity of various graph accessibility problems
Identifieur interne : 000B57 ( Istex/Curation ); précédent : 000B56; suivant : 000B58Lower bounds for the modular communication complexity of various graph accessibility problems
Auteurs : Christoph Meinel ; Stephan WaackSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1995.
Abstract
Abstract: We investigate the modular communication complexity of the graph accessibility problem GAP and its modular counting versions MODk-GAP, k≥2. Due to arguments concerning variation ranks and certain projection reductions, we prove that, for any partition of the input variables and for any moduls k and m, GAP and MODk-GAP have MOD m -communication complexity Ω(n), where n denotes the number of nodes of the graphs under consideration.
Url:
DOI: 10.1007/3-540-59175-3_107
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000C30
Links to Exploration step
ISTEX:D9B2BCFCF8E1CAA608E9808C8CBEE49C06CFFEB8Curation
No country items
Christoph Meinel<affiliation><mods:affiliation>Theoretische Informatik Fachbereich IV, Universität Trier, D-54286, Trier</mods:affiliation><wicri:noCountry code="subField">Trier</wicri:noCountry></affiliation><affiliation><mods:affiliation>Inst. für Num. und Angew. Mathematik, Georg-August-Univ. Göttingen, Lotzestr. 16–18, D-37083, Göttingen</mods:affiliation><wicri:noCountry code="subField">Göttingen</wicri:noCountry></affiliation>Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Lower bounds for the modular communication complexity of various graph accessibility problems</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation><mods:affiliation>Theoretische Informatik Fachbereich IV, Universität Trier, D-54286, Trier</mods:affiliation><wicri:noCountry code="subField">Trier</wicri:noCountry></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. und Angew. Mathematik, Georg-August-Univ. Göttingen, Lotzestr. 16–18, D-37083, Göttingen</mods:affiliation><wicri:noCountry code="subField">Göttingen</wicri:noCountry></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D9B2BCFCF8E1CAA608E9808C8CBEE49C06CFFEB8</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1007/3-540-59175-3_107</idno><idno type="url">https://api.istex.fr/document/D9B2BCFCF8E1CAA608E9808C8CBEE49C06CFFEB8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000C30</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000C30</idno><idno type="wicri:Area/Istex/Curation">000B57</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Lower bounds for the modular communication complexity of various graph accessibility problems</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation><mods:affiliation>Theoretische Informatik Fachbereich IV, Universität Trier, D-54286, Trier</mods:affiliation><wicri:noCountry code="subField">Trier</wicri:noCountry></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. und Angew. Mathematik, Georg-August-Univ. Göttingen, Lotzestr. 16–18, D-37083, Göttingen</mods:affiliation><wicri:noCountry code="subField">Göttingen</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1995</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">D9B2BCFCF8E1CAA608E9808C8CBEE49C06CFFEB8</idno><idno type="DOI">10.1007/3-540-59175-3_107</idno><idno type="ChapterID">31</idno><idno type="ChapterID">Chap31</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: We investigate the modular communication complexity of the graph accessibility problem GAP and its modular counting versions MODk-GAP, k≥2. Due to arguments concerning variation ranks and certain projection reductions, we prove that, for any partition of the input variables and for any moduls k and m, GAP and MODk-GAP have MOD m -communication complexity Ω(n), where n denotes the number of nodes of the graphs under consideration.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B57 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000B57 | 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= Curation
|type= RBID
|clé= ISTEX:D9B2BCFCF8E1CAA608E9808C8CBEE49C06CFFEB8
|texte= Lower bounds for the modular communication complexity of various graph accessibility problems
}}
| This area was generated with Dilib version V0.6.31. |  |