Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs

Extended Abstract
  • Juraj Hromkovič
  • Martin Sauerhoff
Conference paper

DOI: 10.1007/3-540-46541-3_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Hromkovič J., Sauerhoff M. (2000) Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

Abstract

In this paper, lower bound and tradeoff results relating the computational power of determinism, nondeterminism, and randomness for communication protocols and branching programs are presented. The main results can be divided into the following three groups.
  1. (i)

    One of the few major open problems concerning nondeterministic communication complexity is to prove an asymptotically exact tradeoff between complexity and the number of available advice bits. This problem is solved here for the case of one-way communication.

     
  2. (ii)

    Multipartition protocols are introduced as a new type of communication protocols using a restricted form of non-obliviousness. In order to be able to study methods for proving lower bounds on multilective and/or non-oblivious computation, these protocols are allowed to either deterministically or nondeterministically choose between different partitions of the input. Here, the first results showing the potential increase of the computational power by non-obliviousness as well as boundaries on this power are derived.

     
  3. (iii)

    The above results (and others) are applied to obtain several new exponential lower bounds for different types of oblivious branching programs, which also yields new insights into the power of nondeterminism and randomness for the considered models. The proofs rely on a general technique described here which allows to prove explicit lower bounds on the size of oblivious branching programs in an easy and transparent way.

     

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  • Martin Sauerhoff
    • 2
  1. 1.Department of Computer Science I (Algorithms and Complexity)Technological University of AachenAachenGermany
  2. 2.Department of Computer Science, LS 2University of DortmundDortmundGermany

Personalised recommendations