Skip to main content

A tight Ω(loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions

Part of the Lecture Notes in Computer Science book series (LNCS,volume 158)

Abstract

A function f: {0, 1}n → {0, 1} is said to depend on dimension i iff there exists an input vector x such that f(x) differs from f(xi), where xi agrees with x in every dimension except i. In this case x is said to be critical for f with respect to i. f is called nondegenerated iff it depends on all n dimensions.

The main result of this paper is that for each nondegenerated function f: {0, 1}n → {0, 1} there exists an input vector x which is critical with respect to at least Ω(log n) dimensions. A function achieving this bound is presented.

Together with earlier results from Cook,Dwork [2] and Reischuk [3] we can conclude that a parallel RAM requires at least Ω(loglog n) steps to compute f.

Keywords

  • Input Vector
  • Boolean Function
  • Undirected Graph
  • Random Access Memory
  • Single Processor

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-12689-9_124
  • Chapter length: 6 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-38682-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Borodin,J. Hopcroft. Routing and Merging on Parallel Models of Computation. Proc. 14'th annual ACM, 5/1982. pp.338–344.

    Google Scholar 

  2. S. Cook,C. Dwork. Bounds on the Time for Parallel RAM's to Compute Simple Functions. Proc. 14'th annual ACM, 5/1982. pp.231–233.

    Google Scholar 

  3. R.Reischuk. A Lower Time Bound for Parallel RAM's without Simultaneous Writes. IBM Research Report RJ3431 (40917), 3/1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simon, HU. (1983). A tight Ω(loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_124

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_124

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive