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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Amano, K., & Maruoka, A. (2003). Some properties of MODm circuits computing simple functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2653, 227–237. https://doi.org/10.1007/3-540-44849-7_27
Mendeley helps you to discover research relevant for your work.