Abstract
We investigate the complexity of circuits consisting solely of modulo gates and obtain results which might be helpful to derive lower bounds on circuit complexity: (i) We describe a procedure that converts a circuit with only modulo 2p gates, where p is a prime number, into a depth two circuit with modulo 2 gates at the input level and a modulo p gate at the output. (ii) We show some properties of such depth two circuits computing symmetric functions. As a consequence we might think of the strategy for deriving lower bounds on modular circuits: Suppose that a polynomial size constant depth modulo 2p circuit C computes a symmetric function. If we can show that the circuit obtained by applying the procedure given in (i) to the circuit C cannot satisfy the properties described in (ii), then we have a super-polynomial lower bound on the size of a constant depth modulo 2p circuit computing a certain symmetric function.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Allender, “Circuit Complexity before the Dawn of the New Millennium”, Proc. of 16th FSTTCS, LNCS 1180, pp. 1–18, 1996.
R. Beigel and A. Maciel, “Upper and Lower Bounds for Some Depth-3 Circuit Classes”, Computational Complexity, Vol. 6, No. 3, pp. 235–255, 1997.
H. Caussinus, “A Note on a Theorem of Barrington, Straubing and Thérien”, Information Processing Letters, Vol. 58, No. 1, pp. 31–33, 1996.
V. Grolmusz, “A Degree Decreasing Lemma for (MODq-MODp) Circuits”, Disc. Math. and Theor. Comput. Sci., Vol. 4, pp. 247–254, 2001. (a preliminary version appeared in Proc. 25th ICALP, 1998).
V. Grolmusz and G. Tardos, “Lower Bounds for (MODp-MOD m) Circuits”, SIAM J. Comput. Vol. 29, No. 4, pp. 1209–1222, 2000. (a preliminary version appeared in Proc. 39th FOCS, 1998).
J. Kahn and R. Meshulam, “On Mod p Transversals”, Combinatorica, Vol. 11, No. 1, pp. 17–22, 1991.
M. Krause and S. Waack, “Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fanin”, Math. Syst. Theory, Vol. 28, No. 6, pp. 553–564, 1995. (a preliminary version appeared in Proc. 32nd FOCS, 1991).
R. Smolensky, “Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity”, Proc. 19th STOC, pp. 77–82, 1987.
D. Thérien, “Circuits Constructed with MODq Gates Cannot Compute “AND” in Sublinear Size”, Computational Complexity, Vol. 4, pp. 383–388, 1994.
P. Yan and I. Parberry, “Exponential Size Lower Bounds for Some Depth Three Circuits”, Information and Computation, Vol. 112, pp. 117–130, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amano, K., Maruoka, A. (2003). Some Properties of MODm Circuits Computing Simple Functions. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_27
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive