scientific article; zbMATH DE number 2011859

zbMATH Open1032.68083MaRDI QIDQ4437511FDOQ4437511

Authors: Kazuyuki Amano, A. Maruoka 

Publication date: 2 December 2003

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

lower boundsFourier analysissymmetric functionscomposite modulusmodular circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

• Multilinear polynomials modulo composites
• Lower Bounds for (MOD_p - MOD_m) Circuits
• A degree-decreasing lemma for \((\text{MOD}_q - \text{MOD}_p)\) circuits
• Computing all MOD-functions simultaneously
• 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
• Automata, Languages and Programming

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 Q4437511)