{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:48:21Z","timestamp":1673146101915},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf02122800","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T15:43:20Z","timestamp":1126712600000},"page":"189-200","source":"Crossref","is-referenced-by-count":21,"title":["Improved processor bounds for combinatorial problems in RNC"],"prefix":"10.1007","volume":"8","author":[{"given":"Z.","family":"Galil","sequence":"first","affiliation":[]},{"given":"V.","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02122800_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. Berkowitz","year":"1984","unstructured":"S. Berkowitz, On Computing the Determinant in Small Parallel Time Using a Small Number of Processors,Information Processing Letters.18 (1984), 147\u2013150.","journal-title":"Information Processing Letters"},{"key":"BF02122800_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","volume":"58","author":"A. Borodin","year":"1983","unstructured":"A. Borodin, S. Cook andN. Pippenger, Parallel Computation for Well-Endowed Rings and and Space-Bounded Probabilistic Machines,Inform, and Control,58 (1983), 113\u2013136.","journal-title":"Inform, and Control"},{"key":"BF02122800_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","volume":"53","author":"A. Borodin","year":"1982","unstructured":"A. Borodin, J. von zur Gathen andJ. Hopcroft, Fast Parallel Matrix and GCD Computations,Inform. and Control,53 (1982), 241\u2013256.","journal-title":"Inform. and Control"},{"key":"BF02122800_CR4","unstructured":"A.Broder,private communication, 1985."},{"key":"BF02122800_CR5","doi-asserted-by":"crossref","unstructured":"D.Coppersmith and S.Winograd, Matrix Multiplication via Arithmetic Progressions,Proc. 19th Ann. ACM Symp. on Theory of Computing, 1987, 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"BF02122800_CR6","unstructured":"H.Gabow,private communication, 1985."},{"key":"BF02122800_CR7","doi-asserted-by":"crossref","unstructured":"R. M.Karp, E.Uffal and A.Wigderson, Constructing a Perfect Matching Is in Random NC,Proc. 17-th Ann. ACM Symp. on Theory of Computing, (1985), 22\u201332.","DOI":"10.1145\/22145.22148"},{"key":"BF02122800_CR8","volume-title":"A Survey of Matrix Theory and Matrix Inequalities","author":"M. Marcus","year":"1964","unstructured":"M. Marcus andH. Minc,A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston, 1964."},{"key":"BF02122800_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley, U. Vazirani andV. Vazirani, Matching Is As Easy As Matrix Inversion,Combinatorica,7 (1987), 105\u2013114.","journal-title":"Combinatorica"},{"key":"BF02122800_CR10","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/3-540-16042-6_29","volume":"206","author":"V. Pan","year":"1985","unstructured":"V. Pan, Fast and Efficient Parallel Algorithms for Exact Inversion of Integer Matrices,Proc. Fifth Conf. on Software Technology and Theoretical Computer Science, Computer Science,206 (1985), 504\u2013521; Complexity of Parallel Matrix Computations,Theoretical Computer Science,54 (1987) (to appear).","journal-title":"Proc. Fifth Conf. on Software Technology and Theoretical Computer Science, Computer Science"},{"key":"BF02122800_CR11","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0020-0190(78)90079-0","volume":"7","author":"F. P. Preparata","year":"1978","unstructured":"F. P. Preparata andD. V. Sarwate, An Improved Parallel Processor Bound in Fast Matrix Inversion,Inform. Proc. Letters,7 (1978), 148\u2013149.","journal-title":"Inform. Proc. Letters"},{"key":"BF02122800_CR12","unstructured":"M. O.Rabin and V.Vazirani, Maximum Matchings in Graphs through RandomizationTech. Report TR-I5-84, Center for Research in Computer Technology, Aiken Computation Laboratory, Harvard University, 1984."},{"key":"BF02122800_CR13","volume-title":"The Complexity of Computing","author":"J. E. Savage","year":"1976","unstructured":"J. E. Savage,The Complexity of Computing, John Wiley and Sons, N.Y., 1976."},{"key":"BF02122800_CR14","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities,J. of ACM,27 (1980), 701\u2013717.","journal-title":"J. of ACM"},{"key":"BF02122800_CR15","unstructured":"D. Y. Y.Yun, Algebraic Algorithms Usingp-adic Constructions,Proc. 1976 ACM Symp, Symbolic and Algebraic Computation, (1976), 248\u2013259."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122800.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122800\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:22:31Z","timestamp":1557796951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF02122800"],"URL":"https:\/\/doi.org\/10.1007\/bf02122800","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}