Computing all MOD-functions simultaneously

DOI10.1007/978-3-642-30642-6_9MaRDI QIDQ2907489zbMATH OpenOpenAlexFDO

Authors Ivan Mihajlin, Hiroki Morizumi, Evgeny Demenkov, Alexander S. Kulikov

Publication date 10 September 2012

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30642-6_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2011859
• The complexity of computing symmetric functions using threshold circuits
• Automata, Languages and Programming
• A note on the formula size of the ``mod k functions
• New upper bounds on the Boolean circuit complexity of symmetric functions

Cited in

(2)

• On the limits of gate elimination
• A note on the formula size of the ``mod k functions

This page was built for publication: Computing all MOD-functions simultaneously

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