{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T23:27:21Z","timestamp":1677713241926},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01195199","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:16:45Z","timestamp":1108725405000},"page":"105-124","source":"Crossref","is-referenced-by-count":7,"title":["Some results on uniform arithmetic circuit complexity"],"prefix":"10.1007","volume":"27","author":[{"given":"Gudmund S.","family":"Frandsen","sequence":"first","affiliation":[]},{"given":"Mark","family":"Valence","sequence":"additional","affiliation":[]},{"given":"David A.","family":"Mix Barrington","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1145\/76359.76370","volume":"36","author":"E. W. Allender","year":"1989","unstructured":"Allender, E. W., P-Uniform Circuit Complexity.Journal of the Association for Computing Machinery,36 (1989), 912?928.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1006\/jagm.1993.1038","volume":"15","author":"E. Bach","year":"1993","unstructured":"Bach, E., Driscoll, J., and Shallit, J., Factor Refinement.Journal of Algorithms,15 (1993), 199?222.","journal-title":"Journal of Algorithms"},{"key":"CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97062-7","volume-title":"Structural Complexity","author":"J. L. Balc\u00e1zar","year":"1988","unstructured":"Balc\u00e1zar, J. L., Diaz, J., and Gabarr\u00f3, J.,Structural Complexity. Springer-Verlag, New York 1988 (Vol. 1), 1990 (Vol. 2)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D. A. M. Barrington","year":"1990","unstructured":"Barrington, D. A. M., Immerman, N., and Straubing, H., On Uniformity Within NC1.Journal of Computer and System Sciences,41 (1990), 274?306.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A. Borodin","year":"1977","unstructured":"Borodin, A., On Relating Time and Space to Size and Depth.SIAM Journal on Computing,6 (1977), 733?744.","journal-title":"SIAM Journal on Computing"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(92)90335-D","volume":"93","author":"J. Boyar","year":"1992","unstructured":"Boyar, J., Frandsen, G. S., and Sturtivant, C., An Arithmetic Model of Computation Equivalent to Threshold Circuits.Theoretical Computer Science,93 (1992), 303?319.","journal-title":"Theoretical Computer Science"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"A. K. Chandra","year":"1984","unstructured":"Chandra, A. K., Stockmeyer, L., and Vishkin, U., Constant Depth Reducibility.SIAM Journal on Computing,13 (1984), 423?439.","journal-title":"SIAM Journal on Computing"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Frandsen, G. S., Parallel Construction of Irreducible Polynomials. Technical Report DAIMI PB-358, Aarhus University, 1991.","DOI":"10.7146\/dpb.v20i358.7955"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Frandsen, G. S., and Sturtivant, C., The Depth Efficacy of Unbounded Characteristic Finite Field Arithmetic. Technical Report DAIMI PB-240, Aarhus University, 1988.","DOI":"10.7146\/dpb.v17i240.7596"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., Saxe, J. B., and Sipser, M., Parity, Circuits, and the Polynomial Time Hierarchy.Mathematical Systems Theory, 17 (1984), 260?270.","journal-title":"Mathematical Systems Theory"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N., Languages that Capture Complexity Classes.SIAM Journal on Computing,16 (1987), 760?778.","journal-title":"SIAM Journal on Computing"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0218043","volume":"18","author":"N. Immerman","year":"1989","unstructured":"Immerman, N., Expressibility and Parallel Complexity.SIAM Journal on Computing,18 (1989), 625?638.","journal-title":"SIAM Journal on Computing"},{"key":"CR13","first-page":"23","volume":"109","author":"D. Jungnickel","year":"1990","unstructured":"Jungnickel, D., Menezes, A. J., and Vanstone, S. A., On the Number of Self-Dual Bases of GF(qm) over GF(qm).Proceedings of the American Mathematical Society,109 (1990), 23?29.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/0204014","volume":"4","author":"A. Lempel","year":"1975","unstructured":"Lempel, A., Matrix Factorization over GF(2) and Trace-Orthogonal Bases of GF(2n).SIAM Journal on Computing,4 (1975), 175?186.","journal-title":"SIAM Journal on Computing"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0401021","volume":"1","author":"A. Lempel","year":"1988","unstructured":"Lempel, A., and Weinberger, M. J., Self-Complementary Normal Bases in Finite Fields.SIAM Journal on Discrete Mathematics,1 (1988), 193?198.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1090\/S0025-5718-1991-1052099-2","volume":"56","author":"H. W. Lenstra Jr.","year":"1991","unstructured":"Lenstra, Jr., H. W., Finding Isomorphisms Between Finite Fields.Mathematics of Computation,56 (1991), 329?347.","journal-title":"Mathematics of Computation"},{"key":"CR17","volume-title":"Encyclopedia of Mathematics and Its Applications, Vol. 20","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., and Niederreiter, H.,Finite Fields. Encyclopedia of Mathematics and Its Applications, Vol. 20. Addison-Wesley, Reading, MA, 1983."},{"key":"CR18","first-page":"296","volume-title":"Lecture Notes in Computer Science, Vol. 229","author":"H. L\u00fcneburg","year":"1985","unstructured":"L\u00fcneburg, H.,On a Little but Useful Algorithm. Lecture Notes in Computer Science, Vol. 229. Springer-Verlag, Berlin, 1985, pp. 296?301."},{"key":"CR19","volume-title":"Threshold Logic and Its Applications.","author":"S. Muroga","year":"1971","unstructured":"Muroga, S.,Threshold Logic and Its Applications. Wiley\/Interscience, New York, 1971."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. L. Ruzzo","year":"1981","unstructured":"Ruzzo, W. L., On Uniform Circuit Complexity.Journal of Computer and System Sciences,22 (1981), 365?383.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1137\/0209059","volume":"9","author":"G. Seroussi","year":"1980","unstructured":"Seroussi, G., and Lempel, A., Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields.SIAM Journal on Computing,9 (1980), 758?767.","journal-title":"SIAM Journal on Computing"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1090\/S0025-5718-1990-0993933-0","volume":"54","author":"V. Shoup","year":"1990","unstructured":"Shoup, V., New Algorithms for finding Irreducible Polynomials over Finite Fields.Mathematics of Computation,54 (1990), 435?447.","journal-title":"Mathematics of Computation"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/3149.3158","volume":"32","author":"S. Skyum","year":"1985","unstructured":"Skyum, S., and Valiant, L. G., A Complexity Theory Based on Boolean Algebra.Journal of the Association for Computing Machinery,32 (1985), 484?502.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195199.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01195199\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:52:34Z","timestamp":1586119954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01195199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01195199"],"URL":"https:\/\/doi.org\/10.1007\/bf01195199","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}