Presentation 1999/10/25
A Note on CC(6) and (MOD3-MOD2) Circuits
Kazuyuki Amano, Akira Maruoka,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this note, we investigate the complexity of circuits with modulo gates only in two ways. (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. Thus if we can show that, for any linear size constant depth modulo 6 circuit C, a circuit obtained from C by the procedure described in (i) can not satisfy the properties described in (ii), then we could have a superlinear lower bound on the size of a constant depth modulo 6 circuit computing some symmetric functions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) circuit complexity / modulo gate / constant depth circuit / symmetric function / lower bound
Paper # COMP99-48
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Note on CC(6) and (MOD3-MOD2) Circuits
Sub Title (in English)
Keyword(1) circuit complexity
Keyword(2) modulo gate
Keyword(3) constant depth circuit
Keyword(4) symmetric function
Keyword(5) lower bound
1st Author's Name Kazuyuki Amano
1st Author's Affiliation GSIS, Tohoku University()
2nd Author's Name Akira Maruoka
2nd Author's Affiliation GSIS, Tohoku University
Date 1999/10/25
Paper # COMP99-48
Volume (vol) vol.99
Number (no) 388
Page pp.pp.-
#Pages 8
Date of Issue