• DocumentCode
    3449461
  • Title

    Relations between communication complexity classes

  • Author

    Halstenberg, Bernd ; Reischuk, Rüdiger

  • Author_Institution
    Inst. fuer Theor. Inf., Tech. Hochschule Darmstadt, West Germany
  • fYear
    1988
  • fDate
    14-17 Jun 1988
  • Firstpage
    19
  • Lastpage
    28
  • Abstract
    The complexity of communication between two processors is studied in terms of complexity classes. Previously published results showing some analogies between Turing machine classes and the corresponding communication complexity classes are enlarged, and some proper inclusions are shown. The nonuniformity of communication protocols is used to show that the Boolean communication hierarchy does not collapse. For completeness an overview on communication complexity classes is added with proofs of some properties already observed by other authors
  • Keywords
    Turing machines; protocols; Boolean communication hierarchy; Turing machine classes; communication complexity classes; communication protocols; completeness; nonuniformity; Complexity theory; Computational modeling; Context; Natural languages; Protocols; Turing machines; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-8186-0866-8
  • Type

    conf

  • DOI
    10.1109/SCT.1988.5259
  • Filename
    5259
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3449461