{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:11Z","timestamp":1725516791045},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_17","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"160-169","source":"Crossref","is-referenced-by-count":0,"title":["The Orbit Problem Is in the GapL Hierarchy"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[]},{"given":"T. C.","family":"Vijayaraghavan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s000370050023","volume":"8","author":"E. Allender","year":"1999","unstructured":"Allender, E., Beals, R., Ogihara, M.: The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Computational Complexity\u00a08(2), 99\u2013126 (1999)","journal-title":"Computational Complexity"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ita\/1996300100011","volume":"30","author":"E. Allender","year":"1996","unstructured":"Allender, E., Ogihara, M.: Relationships among PL, #L and the Determinant. RAIRO - Theoretical Informatics and Applications\u00a030, 1\u201321 (1996)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"17_CR3","unstructured":"Damm, C.: DET=L# L\n                  . Informatik-Preprint\u00a08, Fachbereich Informatik der Humboldt-Universitat zu, Berlin (1991)"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W. Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.A.M.: Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication. Journal of Computer and System Sciences\u00a065(4), 695\u2013716 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(02)00404-8","volume":"295","author":"T.M. Hoang","year":"2003","unstructured":"Hoang, T.M., Thierauf, T.: The Complexity of the Characteristic and the Minimal Polynomial. Theoretical Computer Science\u00a0295(1-3), 205\u2013222 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR6","unstructured":"Hoang, T.M., Thierauf, T.: The Complexity of the Inertia and Some Closure Properties of Gapl. In: Proceedings of 20th IEEE Conference on Computational Complexity, pp. 28\u201337 (2005)"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1145\/6490.6496","volume":"33","author":"R. Kannan","year":"1986","unstructured":"Kannan, R., Lipton, R.: Polynomial-Time Algorithm for the Orbit Problem. Journal of the ACM\u00a033(4), 808\u2013821 (1986)","journal-title":"Journal of the ACM"},{"key":"17_CR8","unstructured":"Toda, S.: Counting Problems Computationally Equivalent to Computing the Determinant. Technical report 91-07, Department of Computer Science, University of Electro-Communications, Tokyo (1991)"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1017\/CBO9780511526633.008","volume-title":"Proceedings of the London Mathematical Society symposium on Boolean function complexity","author":"L.G. Valiant","year":"1992","unstructured":"Valiant, L.G.: Why is Boolean Complexity Theory Difficult? In: Proceedings of the London Mathematical Society symposium on Boolean function complexity, pp. 84\u201394. Cambridge University Press, New York (1992)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Vinay, V.: Counting Auxiliary Pushdown Automata and Semi-Unbounded Arithmetic Circuits. In: Proceedings of 6th Structure in Complexity Theory Conference (CCC 1991), pp. 270\u2013284 (1991)","DOI":"10.1109\/SCT.1991.160269"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:44:47Z","timestamp":1620002687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}