{"id":"https://openalex.org/W2964165785","doi":"https://doi.org/10.1109/focs.2018.00013","title":"Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids","display_name":"Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2964165785","doi":"https://doi.org/10.1109/focs.2018.00013","mag":"2964165785"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2018.00013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2018.00013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040375566","display_name":"Nima Anari","orcid":"https://orcid.org/0000-0002-4394-3530"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nima Anari","raw_affiliation_strings":["Computer Science Department, Stanford University"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017101724","display_name":"Shayan Oveis Gharan","orcid":"https://orcid.org/0000-0002-5504-0849"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shayan Oveis Gharan","raw_affiliation_strings":["Computer Science and Engineering, University of Washington"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008168066","display_name":"Cynthia Vinzant","orcid":"https://orcid.org/0000-0001-8140-598X"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cynthia Vinzant","raw_affiliation_strings":["Department of Mathematics, North Carolina State University"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, North Carolina State University","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040375566"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":6.6376,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.97600048,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.996399998664856,"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/matroid","display_name":"Matroid","score":0.9535506963729858},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7425675988197327},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.672101616859436},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.5704640746116638},{"id":"https://openalex.org/keywords/oriented-matroid","display_name":"Oriented matroid","score":0.5616762042045593},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5451785922050476},{"id":"https://openalex.org/keywords/orthant","display_name":"Orthant","score":0.5356409549713135},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4941907227039337},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4807736277580261},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.4609331488609314},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.4464346170425415},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4336038827896118},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.4164389967918396},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4139094948768616},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4132021963596344},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4128015339374542}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9535506963729858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7425675988197327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.672101616859436},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.5704640746116638},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.5616762042045593},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5451785922050476},{"id":"https://openalex.org/C2780016784","wikidata":"https://www.wikidata.org/wiki/Q2714507","display_name":"Orthant","level":2,"score":0.5356409549713135},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4941907227039337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4807736277580261},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.4609331488609314},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.4464346170425415},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4336038827896118},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.4164389967918396},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4139094948768616},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4132021963596344},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4128015339374542},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs.2018.00013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2018.00013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1496611045","https://openalex.org/W1524661408","https://openalex.org/W1883732049","https://openalex.org/W1935862350","https://openalex.org/W1976658445","https://openalex.org/W2003979730","https://openalex.org/W2015604011","https://openalex.org/W2022380818","https://openalex.org/W2030810720","https://openalex.org/W2063069123","https://openalex.org/W2072211488","https://openalex.org/W2080656989","https://openalex.org/W2081444009","https://openalex.org/W2093375603","https://openalex.org/W2099111195","https://openalex.org/W2103470671","https://openalex.org/W2127007261","https://openalex.org/W2136716758","https://openalex.org/W2147890987","https://openalex.org/W2160923591","https://openalex.org/W2161611531","https://openalex.org/W2162960148","https://openalex.org/W2210387432","https://openalex.org/W2231816387","https://openalex.org/W2288189968","https://openalex.org/W2295578127","https://openalex.org/W2296319761","https://openalex.org/W2410275234","https://openalex.org/W2522448637","https://openalex.org/W2527398973","https://openalex.org/W2563037975","https://openalex.org/W2584164274","https://openalex.org/W2593579637","https://openalex.org/W2626490819","https://openalex.org/W2962836029","https://openalex.org/W2962984338","https://openalex.org/W2963597340","https://openalex.org/W3104245944","https://openalex.org/W4250589301","https://openalex.org/W4294205440","https://openalex.org/W4294590201","https://openalex.org/W4300012232","https://openalex.org/W6640384157","https://openalex.org/W6670590527","https://openalex.org/W6675571479","https://openalex.org/W6695781988","https://openalex.org/W6696204019","https://openalex.org/W6727777191","https://openalex.org/W6733039426"],"related_works":["https://openalex.org/W2378157773","https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W2980228156","https://openalex.org/W4303709689","https://openalex.org/W1978795414","https://openalex.org/W2153065381","https://openalex.org/W2058489697","https://openalex.org/W2625145881","https://openalex.org/W2159059797"],"abstract_inverted_index":{"We":[0,115],"give":[1],"a":[2,14,54,108,149,161],"deterministic":[3,44],"polynomial":[4,139],"time":[5],"2^O(r)-approximation":[6],"algorithm":[7,46],"for":[8,49,164],"the":[9,21,34,41,65,75,86,136,141,152,156,180,191,197,200],"number":[10,22],"of":[11,13,17,23,26,30,36,57,74,93,140,143,179,190,199],"bases":[12,25,142],"given":[15],"matroid":[16,145],"rank":[18,31],"r":[19],"and":[20,60,96,98,100,112],"common":[24],"any":[27,144],"two":[28,79],"matroids":[29,111],"r.":[32],"To":[33],"best":[35,66],"our":[37,83],"knowledge,":[38],"this":[39,62,128],"is":[40,63,146],"first":[42],"nontrivial":[43],"approximation":[45,122],"that":[47,117,135,186],"works":[48],"arbitrary":[50],"matroids.":[51],"Based":[52],"on":[53,102,171,196],"lower":[55],"bound":[56],"Azar,":[58],"Broder,":[59],"Frieze":[61],"almost":[64],"possible":[67],"assuming":[68],"oracle":[69],"access":[70],"to":[71,106],"independent":[72],"sets":[73],"matroid.":[76],"There":[77],"are":[78],"main":[80],"ingredients":[81],"in":[82,121,130,167],"result:":[84],"For":[85,155,182],"first,":[87],"we":[88,133,159,184],"build":[89],"upon":[90],"recent":[91],"results":[92],"Adiprasito,":[94],"Huh,":[95],"Katz":[97],"Huh":[99],"Wang":[101],"combinatorial":[103],"hodge":[104],"theory":[105],"derive":[107],"connection":[109,129,175],"between":[110],"log-concave":[113,147],"polynomials.":[114,202],"expect":[116],"several":[118],"new":[119],"applications":[120],"algorithms":[123],"will":[124],"be":[125],"derived":[126],"from":[127],"future.":[131],"Formally,":[132],"prove":[134,185],"multivariate":[137],"generating":[138],"as":[148],"function":[150],"over":[151],"positive":[153],"orthant.":[154],"second":[157],"ingredient,":[158],"develop":[160],"general":[162],"framework":[163],"approximate":[165,188],"counting":[166],"discrete":[168],"problems,":[169],"based":[170],"convex":[172],"optimization.":[173],"The":[174],"goes":[176],"through":[177],"subadditivity":[178],"entropy.":[181],"matroids,":[183],"an":[187],"superadditivity":[189],"entropy":[192],"holds":[193],"by":[194],"relying":[195],"log-concavity":[198],"corresponding":[201]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}