{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:30:48Z","timestamp":1768725048511,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0196-6774(92)90018-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"258-273","source":"Crossref","is-referenced-by-count":48,"title":["Random pseudo-polynomial algorithms for exact matroid problems"],"prefix":"10.1016","volume":"13","author":[{"given":"P.M","family":"Camerini","sequence":"first","affiliation":[]},{"given":"G","family":"Galbiati","sequence":"additional","affiliation":[]},{"given":"F","family":"Maffioli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(92)90018-8_BIB1","series-title":"Proceedings, 9th ACM Symp. Theory of Comput.","first-page":"151","article-title":"Reducibility, Randomness and Intractability","author":"Adleman","year":"1977"},{"key":"10.1016\/0196-6774(92)90018-8_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(92)90018-8_BIB3","series-title":"Balancing Signed Toroidal Graphs in Polynomial Time","author":"Barahona","year":"1981"},{"key":"10.1016\/0196-6774(92)90018-8_BIB4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(87)90067-9","article-title":"Exact arborescences, matching and cycles","volume":"16","author":"Barahona","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(92)90018-8_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02591988","article-title":"Two algorithms for weighted matroid intersection","volume":"36","author":"Brezovec","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0196-6774(92)90018-8_BIB6","article-title":"Random Pseudo-Polynomial Algorithms and Exact problems","author":"Camerini","year":"1987"},{"key":"10.1016\/0196-6774(92)90018-8_BIB7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1137\/0402002","article-title":"Intersection of two matroids: (Condensed) Border graphs and ranking","volume":"1","author":"Camerini","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0196-6774(92)90018-8_BIB8","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/0605041","article-title":"Unlabelled partition systems: Optimization and complexity","volume":"5","author":"Camerini","year":"1984","journal-title":"SIAM J. Algebra Discrete Methods"},{"key":"10.1016\/0196-6774(92)90018-8_BIB9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01589104","article-title":"Multi-constrained matroidal knapsack problems","volume":"45","author":"Camerini","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0196-6774(92)90018-8_BIB10","series-title":"Working Conference on Computational Issues in Combinatorial Optimization","article-title":"Antifactors and general factors (extended abstract)","author":"Cornuejols","year":"1986"},{"key":"10.1016\/0196-6774(92)90018-8_BIB11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"System of distinct representatives and linear algebra","volume":"71","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/0196-6774(92)90018-8_BIB12","series-title":"Proceedings, 25th IEEE Symp. on Found. of Comput. Sci.","first-page":"347","article-title":"Efficient implementation of graph algorithms using contractions","author":"Gabow","year":"1984"},{"key":"10.1016\/0196-6774(92)90018-8_BIB13","series-title":"The Theory of Matrices","author":"Gantmacher","year":"1960"},{"key":"10.1016\/0196-6774(92)90018-8_BIB14","series-title":"Computers and Intractability","author":"Garey","year":"1978"},{"key":"10.1016\/0196-6774(92)90018-8_BIB15","series-title":"Algebra","author":"Lang","year":"1965"},{"key":"10.1016\/0196-6774(92)90018-8_BIB16","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0196-6774(92)90018-8_BIB17","first-page":"565","article-title":"On determinants, matchings and random algorithms","volume":"79","author":"Lovasz","year":"1979","journal-title":"Fund. Comput. Theory"},{"key":"10.1016\/0196-6774(92)90018-8_BIB18","series-title":"Matching theory","author":"Lovasz","year":"1986"},{"key":"10.1016\/0196-6774(92)90018-8_BIB19","series-title":"Proceedings, 17th ACM Symp. on the Theory of Computing","first-page":"22","article-title":"Finding a maximum matchings is in RNC","author":"Karp","year":"1985"},{"key":"10.1016\/0196-6774(92)90018-8_BIB20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(86)90058-2","article-title":"Randomized algorithms in combinatorial optimization: A survey","volume":"14","author":"Maffioli","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(92)90018-8_BIB21","series-title":"Combinatorial Optimization Annotated Bibliographies","first-page":"89","article-title":"Randomized algorithms","author":"Maffioli","year":"1985"},{"key":"10.1016\/0196-6774(92)90018-8_BIB22","series-title":"The Theory of Determinants","author":"Muir","year":"1986"},{"key":"10.1016\/0196-6774(92)90018-8_BIB23","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\/0196-6774(92)90018-8_BIB24","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0196-6774(92)90018-8_BIB25","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomial identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90018-8_BIB26","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0196-6774(92)90018-8_BIB27","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoretical Comp. Science"},{"key":"10.1016\/0196-6774(92)90018-8_BIB28","series-title":"Proceedings, 15th ACM Symp. on the Theory of Computing","first-page":"17","article-title":"Parallel algorithms for algebraic problems","author":"von zur Gathen","year":"1983"},{"key":"10.1016\/0196-6774(92)90018-8_BIB29","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677492900188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677492900188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:53:26Z","timestamp":1548744806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677492900188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["0196677492900188"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(92)90018-8","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}