scientific article; zbMATH DE number 18630

zbMATH Open0738.68040MaRDI QIDQ3976033FDOQ3976033

Authors Carsten Damm 

Publication date 26 June 1992

zbMATH Keywords

symmetric functionscircuit complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4035741
• Bounded-depth, polynomial-size circuits for symmetric functions
• An exact characterization of symmetric functions in \(qAC^{0}[2]\)
• scientific article; zbMATH DE number 1222830
• Complexity and structure of circuits for parity functions

Cited in

(8)

• scientific article; zbMATH DE number 3968581 (Why is no real title available?)
• Concrete Multiplicative Complexity of Symmetric Functions
• Symmetric functions capture general functions (extended abstract)
• Computation of level-\(0\) kernels of symmetric logic functions
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
• Complexity and structure of circuits for parity functions
• There are no p-complete families of symmetric Boolean functions
• Tight bounds for the multiplicative complexity of symmetric functions

This page was built for publication:

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