{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:23:43Z","timestamp":1725575023489},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540663294"},{"type":"electronic","value":"9783540484134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48413-4_13","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T12:52:41Z","timestamp":1295009561000},"page":"130-130","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic and Deterministic Approximations of the Permanent"],"prefix":"10.1007","author":[{"given":"Avi","family":"Wigderson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/PL00009316","volume":"18","author":"A.I. Barvinok","year":"1997","unstructured":"Barvinok, A.I.: Computing Mixed Discriminants, Mixed Volumes, and Perma- nents. Discrete & Computational Geometry\u00a018, 205\u2013237 (1997)","journal-title":"Discrete & Computational Geometry"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(92)90234-7","volume":"102","author":"P. Dagum","year":"1992","unstructured":"Dagum, P., Luby, M.: Approximating the Permanent of Graphs with Large Factors. Theretical Computer Science Part A\u00a0102, 283\u2013305 (1992)","journal-title":"Theretical Computer Science Part A"},{"key":"13_CR3","first-page":"643","volume":"24","author":"U. Feige","year":"1992","unstructured":"Feige, U., Lund, C.: On the hardness of computing the permanent of random matrices. STOC\u00a024, 643\u2013654 (1992)","journal-title":"STOC"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. Comput.\u00a018, 1149\u20131178 (1989)","journal-title":"SIAM J. Comput."},{"issue":"4\/5","key":"13_CR5","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/BF01940871","volume":"16","author":"M. Jerrum","year":"1996","unstructured":"Jerrum, M., Vazirani, U.: A mildly exponential approximation algorithm for the permanent. Algorithmica\u00a016(4\/5), 392\u2013401 (1996)","journal-title":"Algorithmica"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1016\/0031-8914(61)90063-5","volume":"27","author":"P.W. Kasteleyn","year":"1961","unstructured":"Kasteleyn, P.W.: The statistics of dimers on a lattice 1. The number of dimmer arrangements on a quadratic lattice. Physica\u00a027, 1209\u20131225 (1961)","journal-title":"Physica"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/0222021","volume":"22","author":"N. Karmarkar","year":"1993","unstructured":"Karmarkar, N., Karp, R., Lipton, R., Lovasz, L., Luby, M.: A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing\u00a022(2), 284\u2013293 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48413-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T20:12:22Z","timestamp":1553371942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48413-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663294","9783540484134"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48413-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}