Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates

DOI10.1007/978-3-540-73545-8_44zbMath1213.94202OpenAlexW1583772930MaRDI QIDQ3608869

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)

Related Items

Weights of exact threshold functions ⋮ Exponential lower bound for bounded depth circuits with few threshold gates ⋮ Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms ⋮ New algorithms and lower bounds for circuits with linear threshold gates