The complexity of symmetric functions in bounded-depth circuits

DOI10.1016/0020-0190(87)90163-3zbMATH Open0653.68019OpenAlexW1974288421MaRDI QIDQ1107989FDOQ1107989

Authors: 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)

Cites Work

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

Cited In (9)

• An exact characterization of symmetric functions in \(qAC^{0}[2]\)
• Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
• Title not available (Why is that?)
• Tight bounds for the multiplicative complexity of symmetric functions
• Entropy of contact circuits and lower bounds on their complexity
• The complexity of computing symmetric functions using threshold circuits
• Coloring k-colorable graphs in constant expected parallel time
• Title not available (Why is that?)
• On the Probabilistic Degrees of Symmetric Boolean Functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107989)