{"id":"https://openalex.org/W1980738047","doi":"https://doi.org/10.2168/lmcs-8(3:5)2012","title":"Formalizing Randomized Matching Algorithms","display_name":"Formalizing Randomized Matching Algorithms","publication_year":2012,"publication_date":"2012-08-10","ids":{"openalex":"https://openalex.org/W1980738047","doi":"https://doi.org/10.2168/lmcs-8(3:5)2012","mag":"1980738047"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(3:5)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:5)2012","pdf_url":"https://lmcs.episciences.org/973/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/973/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108363504","display_name":"Dai Le","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Dai Tri Man Le","raw_affiliation_strings":["University of Toronto"],"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034555443","display_name":"Stephen Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen A. Cook","raw_affiliation_strings":["Department of Computer Science, University of Toronto","University of Toronto"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108363504"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":1.3824,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80560336,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"Volume 8, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7592036128044128},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.663426399230957},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5941058993339539},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.5731724500656128},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5636214017868042},{"id":"https://openalex.org/keywords/perfect-graph-theorem","display_name":"Perfect graph theorem","score":0.5556120872497559},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5300001502037048},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5200831294059753},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5029601454734802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4666467010974884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4342659115791321},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4157387912273407},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3982428014278412},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3686043322086334},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.3105158805847168},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23996245861053467}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7592036128044128},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.663426399230957},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5941058993339539},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.5731724500656128},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5636214017868042},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.5556120872497559},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5300001502037048},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5200831294059753},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5029601454734802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4666467010974884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4342659115791321},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4157387912273407},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3982428014278412},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3686043322086334},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3105158805847168},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23996245861053467},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-8(3:5)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:5)2012","pdf_url":"https://lmcs.episciences.org/973/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1103.5215","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1103.5215","pdf_url":"https://arxiv.org/pdf/1103.5215","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:b503d6a303e44a4388e33037d0ea75d8","is_oa":true,"landing_page_url":"https://doaj.org/article/b503d6a303e44a4388e33037d0ea75d8","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(3:5)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:5)2012","pdf_url":"https://lmcs.episciences.org/973/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1980738047.pdf","grobid_xml":"https://content.openalex.org/works/W1980738047.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W15553240","https://openalex.org/W949816718","https://openalex.org/W1511859173","https://openalex.org/W1537230380","https://openalex.org/W1557310162","https://openalex.org/W1559980198","https://openalex.org/W1607926272","https://openalex.org/W1876112628","https://openalex.org/W1967948656","https://openalex.org/W1980280740","https://openalex.org/W1981234161","https://openalex.org/W1981324778","https://openalex.org/W1998918799","https://openalex.org/W2007273639","https://openalex.org/W2011758726","https://openalex.org/W2019578639","https://openalex.org/W2021736779","https://openalex.org/W2043667326","https://openalex.org/W2050393190","https://openalex.org/W2050735826","https://openalex.org/W2057512592","https://openalex.org/W2071204190","https://openalex.org/W2080132708","https://openalex.org/W2091961944","https://openalex.org/W2109693504","https://openalex.org/W2116335551","https://openalex.org/W2125894854","https://openalex.org/W2137407595","https://openalex.org/W2141461755","https://openalex.org/W2148352980","https://openalex.org/W2170605748","https://openalex.org/W2185541742","https://openalex.org/W2222512263","https://openalex.org/W2293988196","https://openalex.org/W2553523329","https://openalex.org/W2610479830","https://openalex.org/W4248733413"],"related_works":["https://openalex.org/W2184969544","https://openalex.org/W2352066879","https://openalex.org/W2371352078","https://openalex.org/W2949886028","https://openalex.org/W2145951040","https://openalex.org/W2112722105","https://openalex.org/W2080136900","https://openalex.org/W1519280321","https://openalex.org/W2152454366","https://openalex.org/W1980738047"],"abstract_inverted_index":{"Using":[0],"Je\\v{r}\\'abek":[1],"'s":[2],"framework":[3],"for":[4,16,24,31,48,70],"probabilistic":[5],"reasoning,":[6],"we":[7],"formalize":[8],"the":[9,21,45,54,58,76,83],"correctness":[10],"of":[11,57,79],"two":[12],"fundamental":[13],"RNC^2":[14],"algorithms":[15],"bipartite":[17,35],"perfect":[18,39,73],"matching":[19],"within":[20],"theory":[22],"VPV":[23],"polytime":[25],"reasoning.":[26],"The":[27,60],"first":[28],"algorithm":[29,81],"is":[30,42,69,82],"testing":[32,51],"if":[33],"a":[34,38,72],"graph":[36],"has":[37],"matching,":[40,74],"and":[41,67],"based":[43],"on":[44],"Schwartz-Zippel":[46],"Lemma":[47],"polynomial":[49,56],"identity":[50],"applied":[52],"to":[53,64],"Edmonds":[55],"graph.":[59],"second":[61],"algorithm,":[62],"due":[63],"Mulmuley,":[65],"Vazirani":[66],"Vazirani,":[68],"finding":[71],"where":[75],"key":[77],"ingredient":[78],"this":[80],"Isolating":[84],"Lemma.":[85]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}