{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:42Z","timestamp":1759638762801},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/0020-0190(94)90037-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"9-11","source":"Crossref","is-referenced-by-count":6,"title":["On the problem of approximating the number of bases of a matriod"],"prefix":"10.1016","volume":"50","author":[{"given":"Y.","family":"Azar","sequence":"first","affiliation":[]},{"given":"A.Z.","family":"Broder","sequence":"additional","affiliation":[]},{"given":"A.M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90037-X_BIB1","first-page":"442","article-title":"Computing the volume is difficult","author":"B\u00e1r\u00e1nyi","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90037-X_BIB2_1","first-page":"50","article-title":"How hard is it to marry at random? (On the approximation of the permanent)","author":"Broder","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90037-X_BIB2_2","first-page":"551","author":"Broder","year":"1988","journal-title":"Erratum: Proc. 20th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90037-X_BIB3","series-title":"Proc. 2nd IPCO Conf.","first-page":"72","article-title":"Random walks, totally unimodular matrices and a randomised dual simplex algorithm","author":"Dyer","year":"1992"},{"key":"10.1016\/0020-0190(94)90037-X_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","article-title":"A randomised polynomial time algorithm for approximating the volume of convex bodies","volume":"38","author":"Dyer","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)90037-X_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02187701","article-title":"A geometric inequality and the complexity of computing volume","volume":"1","author":"Elekes","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(94)90037-X_BIB6","first-page":"26","article-title":"Balanced matroids","author":"F\u00e9der","year":"1992","journal-title":"Proc. 24th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90037-X_BIB7","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/0097-3165(74)90063-6","article-title":"The asymptotic number of geometries","volume":"16","author":"Knuth","year":"1974","journal-title":"J. Combin. Theory (A)"},{"key":"10.1016\/0020-0190(94)90037-X_BIB8","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz and M. Simonovits, Random walks in a convex body and an improved volume algorithm, Random Structures and Algorithms, to appear.","DOI":"10.1002\/rsa.3240040402"},{"key":"10.1016\/0020-0190(94)90037-X_BIB9","series-title":"Matroid Theory","author":"Oxley","year":"1992"},{"key":"10.1016\/0020-0190(94)90037-X_BIB10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1112\/blms\/3.1.55","article-title":"On the number of combinatorial geometries","volume":"3","author":"Piff","year":"1971","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0020-0190(94)90037-X_BIB11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1017\/S0305004100056498","article-title":"The computational complexity of matroid algorithms","volume":"87","author":"Robinson","year":"1980","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0020-0190(94)90037-X_BIB12","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909490037X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909490037X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:15Z","timestamp":1555131015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909490037X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["002001909490037X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90037-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}