{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:43:58Z","timestamp":1749825838344},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00289-u","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"381-390","source":"Crossref","is-referenced-by-count":6,"title":["Independent sets versus perfect matchings"],"prefix":"10.1016","volume":"145","author":[{"given":"Shang-Hua","family":"Teng","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00289-U_BIB1","series-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing","first-page":"50","article-title":"How hard is to marry at random? on the approximation of the permanent","author":"Broder","year":"1986"},{"key":"10.1016\/0304-3975(94)00289-U_BIB2","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.1016\/0304-3975(94)00289-U_BIB3","series-title":"Current Computations","first-page":"139","article-title":"Optimal tree contraction in the EREW model","author":"Gazit","year":"1988"},{"key":"10.1016\/0304-3975(94)00289-U_BIB4","series-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing","first-page":"235","article-title":"Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved","author":"Jerrum","year":"1988"},{"key":"10.1016\/0304-3975(94)00289-U_BIB5","series-title":"Combinatorica","first-page":"387","article-title":"A randomized parallel algorithm for the odd set cover problem","author":"Karloff","year":"1986"},{"key":"10.1016\/0304-3975(94)00289-U_BIB6","series-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing","first-page":"22","article-title":"Finding a maximum matching is in random NC","author":"Karp","year":"1985"},{"key":"10.1016\/0304-3975(94)00289-U_BIB7","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00289-U_BIB8","series-title":"Proc. 30th Symp. on Foundations of Computer Science","first-page":"112","article-title":"Flow in planar graphs with multiple sources and sinks","author":"Miller","year":"1989"},{"key":"10.1016\/0304-3975(94)00289-U_BIB9","series-title":"26th Symp. on Foundations of Computer Science","first-page":"478","article-title":"Parallel tree contraction and its applications","author":"Miller","year":"1985"},{"key":"10.1016\/0304-3975(94)00289-U_BIB10","series-title":"Perfectly random permuting in parallel","author":"Miller","year":"1988"},{"key":"10.1016\/0304-3975(94)00289-U_BIB11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","article-title":"Matching is as easy as matrix inversion","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(94)00289-U_BIB12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00289-U_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/0890-5401(89)90017-5","article-title":"NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems","author":"Vazirani","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400289U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400289U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T18:54:05Z","timestamp":1556304845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400289U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400289U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00289-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}