The complexity of symmetric boolean functions

This publication has 10 references indexed in Scilit:

• The complexity of symmetric functions in bounded-depth circuits
  Information Processing Letters, 1987
• Properties of complexity measures for PRAMs and WRAMs
  Theoretical Computer Science, 1986
• Almost optimal lower bounds for small depth circuits
  Published by Association for Computing Machinery (ACM) ,1986
• Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹
  Published by Association for Computing Machinery (ACM) ,1986
• Bounded-depth, polynomial-size circuits for symmetric functions
  Theoretical Computer Science, 1985
• Trade-Offs between Depth and Width in Parallel Computation
  SIAM Journal on Computing, 1985
• Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
  Information and Control, 1984
• Simulation of Parallel Random Access Machines by Circuits
  SIAM Journal on Computing, 1984
• A theorem on probabilistic constant depth Computations
  Published by Association for Computing Machinery (ACM) ,1984
• Bounds to Complexities of Networks for Sorting and for Switching
  Journal of the ACM, 1975