{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:47Z","timestamp":1742617187442,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_167","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:46:16Z","timestamp":1330271176000},"page":"65-73","source":"Crossref","is-referenced-by-count":1,"title":["Verifying the determinant in parallel"],"prefix":"10.1007","author":[{"given":"Miklos","family":"Santha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sovanna","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"9_CR1","unstructured":"E. Allender and M. Ogiwara. Relationships Among PL, #L, and the Determinant. to appear in the Proc. 9th IEEE Structure in Complexity Theory, 1994."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or and R. Cleeve. Computing Algebraic Formulas using a Constant Number of Registers. In Proc. 20th ACM STOC, pp. 254\u2013257, 1988.","DOI":"10.1145\/62212.62236"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. J. Berkowitz","year":"1984","unstructured":"S. J. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Information Processing Letter, 18:147\u2013150, March 1984.","journal-title":"Information Processing Letter"},{"key":"9_CR4","unstructured":"M. Blum and S. Kannan. Designing Programs That Check Their Work. In Proc. 21st ACM STOC, pp. 249\u2013261, 1979."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","volume":"48","author":"A. Borodin","year":"1983","unstructured":"A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed ring and space-Bounded probabilistic machines. Information and Control, 48:113\u2013136, 1983.","journal-title":"Information and Control"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","volume":"52","author":"A. Borodin","year":"1982","unstructured":"A. Borodin, J. von zur Gathen, and J. Hopcroft. Fast parallel matrix and GCD computation. Information and Control, 52:241\u2013256, 1982.","journal-title":"Information and Control"},{"key":"9_CR7","first-page":"63","volume":"199","author":"A.L Chistov","year":"1985","unstructured":"A.L Chistov. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. In Proc. Int. Conf. Found. of Comp. Theory, Springer LNCS, vol. 199, pp. 63\u201369, 1985.","journal-title":"Proc. Int. Conf. Found. of Comp. Theory, Springer LNCS"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inf. and Cont., 64:2\u201322, 1985.","journal-title":"Inf. and Cont."},{"issue":"4","key":"9_CR9","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","volume":"5","author":"L. Csanky","year":"1976","unstructured":"L. Csanky. Fast Parallel Matrix Inversion Algorithms. SIAM J. COMP., 5(4),pp. 618\u2013623, 1976.","journal-title":"SIAM J. COMP."},{"key":"9_CR10","unstructured":"C. Damm. DET=L #L. Informatik-Preprint, Fachbereich Informatik der Humboldt-Universit\u00e4t zu Berlin, 8, 1991."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. In Proc. 6th IEEE Structure in Complexity Theory, pp. 30\u201342, 1991.","DOI":"10.1109\/SCT.1991.160241"},{"key":"9_CR12","unstructured":"J. von zur Gathen. Parallel Linear Algebra. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pp. 574\u2013615. Morgan Kaufmann Publishers, 1993."},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(80)90042-3","volume":"11","author":"O.H. Ibarra","year":"1980","unstructured":"O.H. Ibarra, S. Moran, and L.E. Rosier. A note on the parallel complexity of computing the rank of order n matrices. Inf. Proc. Letter, 11:162, 1980.","journal-title":"Inf. Proc. Letter"},{"key":"9_CR14","volume-title":"PhD thesis","author":"S. Kannan","year":"1989","unstructured":"Sampath Kannan. Program Checkers for algebraic problems. PhD thesis, International Computer Science Institute, Berkeley, CA, 1989."},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica, 7:101\u2013104, 1987.","journal-title":"Combinatorica"},{"key":"9_CR16","unstructured":"S. Toda. Counting Problems Computationally Equivalent to Computing the Determinant. Technical report, CSIM 91-07, 1991."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/116825.116858","volume":"38","author":"J. Tor\u00e1n","year":"1991","unstructured":"J. Tor\u00e1n. Complexity classes defined by counting quantifiers. Journal of the Association for Computing Machinery, 38:753\u2013744, 1991.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"L.G. Valiant. Completeness classes in algebra. In Proc. 11th ACM STOC, pp. 249\u2013261, 1979.","DOI":"10.1145\/800135.804419"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"L.G. Valiant. Why is Boolean complexity theory difficult? In M.S. Paterson ed., Boolean Function Complexity. Cambridge Univ. Press, 1992.","DOI":"10.1017\/CBO9780511526633.008"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"V. Vinay. Counting auxialiary pushdown automata and semi-unbounded arithmetic circuits. In Proc. 6th IEEE Structure in Complexity Theory, pp. 270\u2013284, 1991.","DOI":"10.1109\/SCT.1991.160269"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_167.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:25:30Z","timestamp":1742595930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_167","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}