The complexity of symmetric functions in bounded-depth circuits

DOI10.1016/0020-0190(87)90163-3zbMath0653.68019OpenAlexW1974288421MaRDI QIDQ1107989

Bettina Brustmann, Ingo Wegener

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90163-3

zbMATH Keywords

symmetric functionsbounded-depth circuitcombinatorial complexity measuresensitive complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Entropy of contact circuits and lower bounds on their complexity ⋮ Coloring k-colorable graphs in constant expected parallel time ⋮ An exact characterization of symmetric functions in \(qAC^{0}[2\)] ⋮ On the Probabilistic Degrees of Symmetric Boolean Functions

Cites Work

• Properties of complexity measures for PRAMs and WRAMs
• Bounded-depth, polynomial-size circuits for symmetric functions
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• Parity, circuits, and the polynomial-time hierarchy

This page was built for publication: The complexity of symmetric functions in bounded-depth circuits