Abstract
The class of symmetric Boolean functions contains many fundamental functions, among them all types of counting functions. Hence the efficient computation of symmetric functions is a fundamental problem in computer science. Known results on the complexity of symmetric functions in several models of computation are described and new results on the complexity of symmetric functions with respect to bounded depth circuits and parallel random access machines are presented.
Supported in part by DFG-grants No. We 1066/1–2 and Me 872/1–1
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ajtai M, Ben-Or M (1984) A theorem on probabilistic constant depth computations. 16.STOC: 471–474
Ajtai M, Komlós J, Szemerédi E (1983) An 0(n log n) sorting network, 15.STOC: 1–9
Barrington DA (1986) Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. 18.STOC: 1–5
Beame P (1986) Lower bounds in parallel machine computation. Ph.D.Thesis.Univ.Toronto
Brustmann B, Wegener I (1986) The complexity of symmetric functions in bounded-depth circuits. To appear: Information Processing Letters
Bublitz S, Schürfeld U, Voigt B, Wegener I (1986) Properties of complexity measures for PRAMs and WRAMs. To appear: Theoretical Computer Science
Denenberg L, Gurevich Y, Shelah S (1983) Cardinalities definable by constant-depth, polynomial-size circuits. TR Harvard Univ.
Fagin R, Klawe MM, Pippenger NJ, Stockmeyer L (1985) Bounded-depth, polynomial-size circuits for symmetric functions. Theoretical Computer Science 36: 239–250
Hastad J (1986) Almost optimal lower bounds for small depth circuits. 18.STOC: 6–20
Muller DE, Preparata FP (1975) Bounds to complexities of networks for sorting and switching. Journal of the ACM 22: 195–201
Stockmeyer L, Vishkin U (1984) Simulation of parallel random access machines by circuits. SIAM J.on Computing 13:409–422
Vishkin U, Wigderson A (1985) Trade-offs between depth and width in parallel computation. SIAM J.on Computing 14: 303–314
Wegener I (1984) Optimal decision trees and one-time-only branching programs for symmetric Boolean functions. Information and Control 62: 129–143
Wegener I (1986) The range of new lower bound techniques for WRAMs and bounded depth circuits. To appear: EIK.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wegener, I. (1987). The complexity of symmetric boolean functions. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_185
Download citation
DOI: https://doi.org/10.1007/3-540-18170-9_185
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18170-5
Online ISBN: 978-3-540-47795-2
eBook Packages: Springer Book Archive