Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates

DOI10.1007/978-3-540-73545-8_44MaRDI QIDQ3608869zbMATH OpenOpenAlexFDO

Authors Kristoffer Arnsfelt Hansen

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_44

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of computing symmetric functions using threshold circuits
• scientific article; zbMATH DE number 512859
• scientific article; zbMATH DE number 23013
• Computing Boolean functions by polynomials and threshold circuits
• scientific article; zbMATH DE number 609985
• Circuit complexity of symmetric Boolean functions in antichain basis
• On the complexity of monotone circuits for threshold symmetric Boolean functions
• scientific article; zbMATH DE number 4035741
• New upper bounds on the Boolean circuit complexity of symmetric functions
• scientific article; zbMATH DE number 4211970

Cited in

(9)

• scientific article; zbMATH DE number 4211970 (Why is no real title available?)
• Exponential lower bound for bounded depth circuits with few threshold gates
• The complexity of computing symmetric functions using threshold circuits
• Weights of exact threshold functions
• The complexity of depth-3 circuits computing symmetric Boolean functions
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
• Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms
• A lifting theorem with applications to symmetric functions
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression

This page was built for publication: Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates

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