{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:13Z","timestamp":1725488533189},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_27","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:26:17Z","timestamp":1186727177000},"page":"227-237","source":"Crossref","is-referenced-by-count":0,"title":["Some Properties of MODm Circuits Computing Simple Functions"],"prefix":"10.1007","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"27_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. of 16th FSTTCS","author":"E. Allender","year":"1996","unstructured":"E. Allender, \u201cCircuit Complexity before the Dawn of the New Millennium\u201d, Proc. of 16th FSTTCS, LNCS 1180, pp. 1\u201318, 1996."},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01294257","volume":"6","author":"R. Beigel","year":"1997","unstructured":"R. Beigel and A. Maciel, \u201cUpper and Lower Bounds for Some Depth-3 Circuit Classes\u201d, Computational Complexity, Vol. 6, No. 3, pp. 235\u2013255, 1997.","journal-title":"Computational Complexity"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(96)00029-4","volume":"58","author":"H. Caussinus","year":"1996","unstructured":"H. Caussinus, \u201cA Note on a Theorem of Barrington, Straubing and Th\u00e9rien\u201d, Information Processing Letters, Vol. 58, No. 1, pp. 31\u201333, 1996.","journal-title":"Information Processing Letters"},{"key":"27_CR4","first-page":"247","volume":"4","author":"V. Grolmusz","year":"2001","unstructured":"V. Grolmusz, \u201cA Degree Decreasing Lemma for (MODq-MODp) Circuits\u201d, Disc. Math. and Theor. Comput. Sci., Vol. 4, pp. 247\u2013254, 2001. (a preliminary version appeared in Proc. 25th ICALP, 1998).","journal-title":"Disc. Math. and Theor. Comput. Sci."},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1137\/S0097539798340850","volume":"29","author":"V. Grolmusz","year":"2000","unstructured":"V. Grolmusz and G. Tardos, \u201cLower Bounds for (MODp-MOD m) Circuits\u201d, SIAM J. Comput. Vol. 29, No. 4, pp. 1209\u20131222, 2000. (a preliminary version appeared in Proc. 39th FOCS, 1998).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01375469","volume":"11","author":"J. Kahn","year":"1991","unstructured":"J. Kahn and R. Meshulam, \u201cOn Mod p Transversals\u201d, Combinatorica, Vol. 11, No. 1, pp. 17\u201322, 1991.","journal-title":"Combinatorica"},{"issue":"6","key":"27_CR7","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BF01204170","volume":"28","author":"M. Krause","year":"1995","unstructured":"M. Krause and S. Waack, \u201cVariation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fanin\u201d, Math. Syst. Theory, Vol. 28, No. 6, pp. 553\u2013564, 1995. (a preliminary version appeared in Proc. 32nd FOCS, 1991).","journal-title":"Math. Syst. Theory"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"R. Smolensky, \u201cAlgebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity\u201d, Proc. 19th STOC, pp. 77\u201382, 1987.","DOI":"10.1145\/28395.28404"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01263425","volume":"4","author":"D. Th\u00e9rien","year":"1994","unstructured":"D. Th\u00e9rien, \u201cCircuits Constructed with MODq Gates Cannot Compute \u201cAND\u201d in Sublinear Size\u201d, Computational Complexity, Vol. 4, pp. 383\u2013388, 1994.","journal-title":"Computational Complexity"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/inco.1994.1054","volume":"112","author":"P. Yan","year":"1994","unstructured":"P. Yan and I. Parberry, \u201cExponential Size Lower Bounds for Some Depth Three Circuits\u201d, Information and Computation, Vol. 112, pp. 117\u2013130, 1994.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T02:08:01Z","timestamp":1550714881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}