{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:45Z","timestamp":1725551145815},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633075"},{"type":"electronic","value":"9783540694229"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_67","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T15:22:48Z","timestamp":1270480968000},"page":"282-283","source":"Crossref","is-referenced-by-count":1,"title":["Parallel vs. parametric complexity"],"prefix":"10.1007","author":[{"given":"Ketan","family":"Mulmuley","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. Goldberg","year":"1988","unstructured":"A. Goldberg, R. Tarjan, A new approach to the maximum-flow problem, JACM, 35: 921\u2013940, 1988.","journal-title":"JACM"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","volume":"6","author":"R. Karp","year":"1986","unstructured":"R. Karp, E. Upfal, A. Wigderson, Constructing a perfect matching is in random NC, Combinatorica, 6:35\u201348, 1986.","journal-title":"Combinatorica"},{"key":"25_CR3","volume-title":"Matching theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz, M. Plummer, Matching theory, Akad\u00e9miai Kiad\u00f3, Budapest, 1986."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"K. Mulmuley, Is there an algebraic proof for P \u2260 NC?, Proceedings of the ACM Symposium on Theory of Computing, 1997.","DOI":"10.1145\/258533.258586"},{"key":"25_CR5","unstructured":"K. Mulmuley, Lower bounds in a parallel model without bit operations, to appear in the SIAM Journal of Computing, available at the author's web address."},{"issue":"1","key":"25_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley, U. Vazirani, V. Vazirani, Matching is as easy as matrix inversion, Combinatorica, 7(1):105\u2013113, 1987.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:16:18Z","timestamp":1558988178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}