{"id":"https://openalex.org/W2949942456","doi":null,"title":"Counting Perfect Matchings as Fast as Ryser\u2217","display_name":"Counting Perfect Matchings as Fast as Ryser\u2217","publication_year":2016,"publication_date":"2016-08-17","ids":{"openalex":"https://openalex.org/W2949942456","mag":"2949942456"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.764.7663","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.764.7663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1107.4466.pdf","raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"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.6025000214576721,"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.6025000214576721,"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.38350000977516174,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.00860000029206276,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/counting-perfect-matchings","display_name":"counting perfect matchings","score":0.8820000290870667},{"id":"https://openalex.org/keywords/hafnian","display_name":"hafnian","score":0.9070000052452087},{"id":"https://openalex.org/keywords/permanent","display_name":"permanent","score":0.6819999814033508},{"id":"https://openalex.org/keywords/polynomial-space-algorithms","display_name":"polynomial space algorithms","score":0.777999997138977},{"id":"https://openalex.org/keywords/exact-counting","display_name":"exact counting","score":0.49000000953674316},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.6340000033378601}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7725403904914856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7059277296066284},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5447145700454712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5374330878257751},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5158973932266235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4847957193851471},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45963555574417114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4363335371017456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3428937792778015}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.764.7663","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.764.7663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1107.4466.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W226703363","https://openalex.org/W1497895992","https://openalex.org/W1604283551","https://openalex.org/W1988642505","https://openalex.org/W1995725694","https://openalex.org/W2001868457","https://openalex.org/W2006912660","https://openalex.org/W2048068744","https://openalex.org/W2074359677","https://openalex.org/W2139273248","https://openalex.org/W2160392814"],"related_works":["https://openalex.org/W2611124388","https://openalex.org/W7114767722","https://openalex.org/W138944661","https://openalex.org/W7100877561","https://openalex.org/W2765017487","https://openalex.org/W2965117815","https://openalex.org/W2780230999","https://openalex.org/W2611242280","https://openalex.org/W2036139974","https://openalex.org/W1481767492"],"abstract_inverted_index":{"Previous":[0,203],"chapter":[1,3,204,206],"Next":[2,205],"Full":[4],"AccessProceedings":[5],"Proceedings":[6],"of":[7,47,105,121,156,158],"the":[8,45,70,73,89,117,123,143],"2012":[9],"Annual":[10],"ACM-SIAM":[11],"Symposium":[12],"on":[13,201],"Discrete":[14],"Algorithms":[15],"(SODA)Counting":[16],"Perfect":[17],"Matchings":[18],"as":[19,21],"Fast":[20],"RyserAndreas":[22],"Bj\u00f6rklundAndreas":[23],"Bj\u00f6rklundpp.914":[24],"-":[25],"921Chapter":[26],"DOI:https://doi.org/10.1137/1.9781611973099.73PDFBibTexSections":[27],"ToolsAdd":[28],"to":[29,101,130],"favoritesExport":[30],"CitationTrack":[31],"CitationsEmail":[32],"SectionsAboutAbstract":[33],"We":[34,112,136],"show":[35],"that":[36,43,104],"there":[37,178],"is":[38],"a":[39,139,151],"polynomial":[40,87,102],"space":[41,75],"algorithm":[42,82,92,108,115,132],"counts":[44],"number":[46],"perfect":[48],"matchings":[49],"in":[50,54,63,116,167],"an":[51,126,159,187],"n-vertex":[52],"graph":[53],"O*(2n/2)":[55],"\u2282":[56,79],"O(1.415n)":[57],"time.":[58],"(O*(f(n))":[59],"suppresses":[60],"functions":[61],"polylogarithmic":[62],"f(n)).":[64],"The":[65],"previously":[66],"fastest":[67],"algorithms":[68,184],"for":[69,86,109,133,172,185,194],"problem":[71,149],"was":[72],"exponential":[74],"O*(((1":[76],"+":[77,214],"\u221a5)/2)n)":[78],"O(1.619n)":[80],"time":[81,91,171,183],"by":[83,93],"Koivisto,":[84],"and":[85],"space,":[88],"O(1.942n)":[90],"Nederlof.":[94],"Our":[95],"new":[96],"algorithm's":[97],"runtime":[98],"matches":[99],"up":[100],"factors":[103],"Ryser's":[106,131],"1963":[107],"bipartite":[110],"graphs.":[111],"present":[113],"our":[114],"more":[118],"general":[119,144],"setting":[120],"computing":[122,186],"hafnian":[124],"over":[125,150],"arbitrary":[127],"ring,":[128],"analogously":[129],"permanent":[134],"computation.":[135],"also":[137],"give":[138],"simple":[140],"argument":[141],"why":[142],"exact":[145],"set":[146,163],"cover":[147],"counting":[148],"slightly":[152],"superpolynomial":[153],"sized":[154],"family":[155],"subsets":[157],"n":[160,188,190],"element":[161],"ground":[162],"cannot":[164],"be":[165],"solved":[166],"O*(2(1":[168,180],"\u2212":[169,181],"\u03b51)n)":[170,182],"any":[173],"\u220a1":[174],">":[175,197],"0":[176,198],"unless":[177],"are":[179],"\u00d7":[189],"0/1":[191],"matrix":[192],"permanent,":[193],"some":[195],"\u220a2":[196],"depending":[199],"only":[200],"\u220a1.":[202],"RelatedDetails":[207],"Published:2012ISBN:978-1-61197-210-8eISBN:978-1-61197-309-9":[208],"https://doi.org/10.1137/1.9781611973099Book":[209],"Series":[210],"Name:ProceedingsBook":[211],"Code:PR141Book":[212],"Pages:xiii":[213],"1757":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2019-06-27T00:00:00"}