{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:23:44Z","timestamp":1775838224248,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1006\/jcss.2001.1764","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T14:19:44Z","timestamp":1032358784000},"page":"186-200","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the Complexity of Some Problems on Groups Input as Multiplication Tables"],"prefix":"10.1006","volume":"63","author":[{"given":"David Mix","family":"Barrington","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kadau","sequence":"additional","affiliation":[]},{"given":"Klaus-J\u00f6rn","family":"Lange","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"McKenzie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcss.2001.1764_RF1","series-title":"Proc. 16th IEEE Conference on Computational Complexity","article-title":"Uniform circuits for division: Consequences and problems","author":"Allender","year":"2001"},{"key":"10.1006\/jcss.2001.1764_RF2","article-title":"Uniform constant-depth threshold circuits for division and iterated multiplication","author":"Hesse","year":"2001","journal-title":"J. Comput. System Sci."},{"key":"10.1006\/jcss.2001.1764_RF3","series-title":"Proc. 17th ACM STOC","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1006\/jcss.2001.1764_RF4","series-title":"Proc. 25th IEEE FOCS","article-title":"On the complexity of matrix group problems I","author":"Babai","year":"1984"},{"key":"10.1006\/jcss.2001.1764_RF5","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Bounded-width polynomial-size size branching programs recognize exactly those languages in NC1","volume":"38","author":"Barrington","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1006\/jcss.2001.1764_RF6","series-title":"Complexity Theory Retrospective II","first-page":"1","article-title":"Time, hardware, and uniformity","author":"Barrington","year":"1997"},{"key":"10.1006\/jcss.2001.1764_RF7","series-title":"Proc. 15th IEEE Conference on Computational Complexity","article-title":"On the complexity of some problems on groups input as multiplication tables","author":"Barrington","year":"2000"},{"key":"10.1006\/jcss.2001.1764_RF8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0890-5401(91)90017-V","article-title":"Oracle branching programs and Logspace versus P","volume":"95","author":"Barrington","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1006\/jcss.2001.1764_RF9","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1006\/jcss.2001.1764_RF10","series-title":"Proc. 19th ACM STOC","article-title":"Permutation Groups in NC","author":"Babai","year":"1987"},{"key":"10.1006\/jcss.2001.1764_RF11","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","article-title":"Log depth circuits for division and related problems","volume":"15","author":"Beame","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jcss.2001.1764_RF12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s000370050014","article-title":"Improved lower bounds for small distance connectivity","volume":"7","author":"Beame","year":"1998","journal-title":"Comput. Complexity"},{"key":"10.1006\/jcss.2001.1764_RF13","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jcss.2001.1764_RF14","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jcss.2001.1764_RF15","unstructured":"A. Chiu, G. Davida, and, B. Litow, NC1 division, Preliminary version. Also available at, http:\/\/www.cs.jcu.edu.au as bruce\/papers\/crr00.ps.gz."},{"key":"10.1006\/jcss.2001.1764_RF16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1006\/jcss.2001.1764_RF17","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1006\/jcss.2001.1764_RF18","series-title":"Proc. 21st IEEE FOCS","article-title":"Polynomial time algorithms for permutation groups","author":"Furst","year":"1980"},{"key":"10.1006\/jcss.2001.1764_RF19","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1006\/jcss.2001.1764_RF20","series-title":"Computational Limitations of Small Depth Circuits","author":"H\u00e5stad","year":"1988"},{"key":"10.1006\/jcss.2001.1764_RF21","series-title":"Proc. 28th ICALP","article-title":"Division is in uniform TC0","author":"Hesse","year":"2001"},{"key":"10.1006\/jcss.2001.1764_RF22","series-title":"Group-Theoretic Algorithms and Graph Isomorphism","volume":"136","author":"Hoffmann","year":"1979"},{"key":"10.1006\/jcss.2001.1764_RF23","series-title":"Computational Complexity Theory","first-page":"75","article-title":"Descriptive and computational complexity","volume":"38","author":"Immerman","year":"1989"},{"key":"10.1006\/jcss.2001.1764_RF24","series-title":"Descriptive Complexity","author":"Immerman","year":"1999"},{"key":"10.1006\/jcss.2001.1764_RF25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/jcss.2001.1764_RF26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1006\/jcss.2001.1764_RF27","series-title":"Proceedings of the Johns Hopkins University Conference on Information Sciences and Systems","article-title":"The complexity of word and isomorphism problems for finite groups","author":"Lipton","year":"1976"},{"key":"10.1006\/jcss.2001.1764_RF28","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0022-0000(88)90044-X","article-title":"Parallel algorithms for solvable permutation groups","volume":"37","author":"Luks","year":"1988","journal-title":"J. Comput. Systems Sci."},{"key":"10.1006\/jcss.2001.1764_RF29","series-title":"Proc. 24th IEEE FOCS","article-title":"The parallel complexity of the abelian permutation group membership problem","author":"McKenzie","year":"1983"},{"key":"10.1006\/jcss.2001.1764_RF30","series-title":"The theory of Groups","author":"Rotman","year":"1973"},{"key":"10.1006\/jcss.2001.1764_RF31","series-title":"Computational Problems in Abstract Algebra","first-page":"169","article-title":"Computational methods in the study of permutation groups","author":"Sims","year":"1970"},{"key":"10.1006\/jcss.2001.1764_RF32","series-title":"Proc. 15th ACM STOC","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"key":"10.1006\/jcss.2001.1764_RF33","series-title":"Proc. 19th ACM STOC","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1006\/jcss.2001.1764_RF34","volume":"CS-80-19","author":"Th\u00e9rien","year":"1980","journal-title":"Research Report"},{"key":"10.1006\/jcss.2001.1764_RF35","series-title":"Proc. 26th IEEE FOCS","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000001917647?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000001917647?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T06:05:25Z","timestamp":1668578725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000001917647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0022000001917647"],"URL":"https:\/\/doi.org\/10.1006\/jcss.2001.1764","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the Complexity of Some Problems on Groups Input as Multiplication Tables","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1006\/jcss.2001.1764","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Academic Press. All rights reserved.","name":"copyright","label":"Copyright"}]}}