Some properties of MOD_m circuits computing simple functions

DOI10.1007/3-540-44849-7_27MaRDI QIDQ4437511zbMATH OpenFDO

Authors Kazuyuki Amano, A. Maruoka

Publication date 2 December 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530227.htm

zbMATH Keywords

composite modulusFourier analysislower boundsmodular circuitssymmetric functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Lower Bounds for (MOD_p - MOD_m) Circuits
• scientific article; zbMATH DE number 1379303
• Lower bounds for modular counting by circuits with modular gates
• Automata, Languages and Programming
• Lower bounds for modular counting by circuits with modular gates

Cited in

(12)

• On mod \(p\) transversals
• A note on a theorem of Barrington, Straubing and Thérien
• Lower bounds for modular counting by circuits with modular gates
• A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits
• A degree-decreasing lemma for \((\text{MOD}_q - \text{MOD}_p)\) circuits
• On the computational power of depth 2 circuits with threshold and modulo gates
• Computing all MOD-functions simultaneously
• Multilinear polynomials modulo composites
• scientific article; zbMATH DE number 1256663 (Why is no real title available?)
• scientific article; zbMATH DE number 1379303 (Why is no real title available?)
• Lower Bounds for (MOD_p - MOD_m) Circuits
• Automata, Languages and Programming

This page was built for publication: Some properties of MOD\(_m\) circuits computing simple functions

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