{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:23:38Z","timestamp":1758709418129,"version":"3.32.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf01263421","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T02:52:34Z","timestamp":1111632754000},"page":"325-338","source":"Crossref","is-referenced-by-count":13,"title":["Complex polynomials and circuit lower bounds for modular counting"],"prefix":"10.1007","volume":"4","author":[{"given":"David A. Mix","family":"Barrington","sequence":"first","affiliation":[]},{"given":"Howard","family":"Straubing","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"J. Aspnes, R. Beigel, M. Furst, and S. Rudich, The expressive power of voting polynomials. InProc. Twenty-third Ann. ACM Symp. Theor. Comput., 1991, 402?409.","DOI":"10.1145\/103418.103461"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"D. A. M. Barrington and H. Straubing, Complex polynomials and circuit lower bounds for modular counting. InProceedings of LATIN '92 (1st Latin American Symposium on Theoretical Informatics), 1992, 24?31.","DOI":"10.1007\/BFb0023814"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","volume":"89","author":"D. A. M. Barrington","year":"1990","unstructured":"D. A. M. Barrington, H. Straubing, andD. Th\u00e9rien, Nonuniform automata over groups.Inform. and Comput. 89 (1990), 109?132.","journal-title":"Inform. and Comput."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"R. Beigel, When do extra majority gates help? Polylog(n) majority gates are equivalent to one. InProc. Twenty-fourth Ann. ACM Symp. Theor. Comput., 1992, 450?454.","DOI":"10.1145\/129712.129755"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"R. Beigel, N. Reingold, and D. Spielman, The perceptron strikes back. InStructure in Complexity Theory: Sixth Annual Conference, 1991a, 286?293.","DOI":"10.1109\/SCT.1991.160270"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"R. Beigel, N. Reingold, and D. Spielman, PP is closed under intersection. InProc. Twenty-third Ann. ACM Symp. Theor. of Comput., 1991b, 1?9.","DOI":"10.1145\/103418.103426"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"F. Green, An oracle separating ?P fromPP PH . InStructure in Complexity Theory: Fifth Annual Conference, 1990, 295?298.","DOI":"10.1109\/SCT.1990.113977"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"N. Linial, Y. Mansour and N. Nisan, Constant-depth circuits, Fourier transforms and learnability. InProc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 574?579.","DOI":"10.1109\/SFCS.1989.63537"},{"key":"CR9","volume-title":"Perceptrons","author":"M. L. Minsky","year":"1988","unstructured":"M. L. Minsky andS. A. Papert,Perceptrons. MIT Press, Cambridge, MA, 1988. (Expanded edition, original edition was in 1968.)"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity. InProc. Nineteenth Ann. ACM Symp. Theor. of Comput., 1987, 77?82.","DOI":"10.1145\/28395.28404"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01263421.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01263421\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01263421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T08:12:32Z","timestamp":1735373552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01263421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF01263421"],"URL":"https:\/\/doi.org\/10.1007\/bf01263421","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"type":"print","value":"1016-3328"},{"type":"electronic","value":"1420-8954"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}