{"id":"https://openalex.org/W2474151873","doi":"https://doi.org/10.1137/16m1101003","title":"Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials","display_name":"Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2474151873","doi":"https://doi.org/10.1137/16m1101003","mag":"2474151873"},"language":"en","primary_location":{"id":"doi:10.1137/16m1101003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1101003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1607.01167","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031655569","display_name":"Viresh Patel","orcid":"https://orcid.org/0000-0001-8047-350X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Viresh Patel","raw_affiliation_strings":["Institute for Mathematics, University of Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Mathematics, University of Amsterdam","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072303140","display_name":"Guus Regts","orcid":"https://orcid.org/0000-0002-7813-4952"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Guus Regts","raw_affiliation_strings":["Korteweg de Vries Institute for Mathematics, University of Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korteweg de Vries Institute for Mathematics, University of Amsterdam","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031655569"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.9708,"has_fulltext":true,"cited_by_count":115,"citation_normalized_percentile":{"value":0.99227379,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"46","issue":"6","first_page":"1893","last_page":"1919"},"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.9959999918937683,"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.9934999942779541,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tutte-polynomial","display_name":"Tutte polynomial","score":0.6927623748779297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6250818967819214},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.563091516494751},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5264490246772766},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5033664107322693},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5019798278808594},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.457705020904541},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.43247509002685547},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.42008769512176514},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3184940814971924},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2857011556625366},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1876133382320404}],"concepts":[{"id":"https://openalex.org/C14447369","wikidata":"https://www.wikidata.org/wiki/Q7857002","display_name":"Tutte polynomial","level":5,"score":0.6927623748779297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6250818967819214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.563091516494751},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5264490246772766},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5033664107322693},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5019798278808594},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.457705020904541},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.43247509002685547},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.42008769512176514},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3184940814971924},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2857011556625366},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1876133382320404},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/16m1101003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1101003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/73e095ec-91b9-486d-8b98-1df98fb2c490","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/deterministic-polynomialtime-approximation-algorithms-for-partition-functions-and-graph-polynomials(73e095ec-91b9-486d-8b98-1df98fb2c490).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Patel, V & Regts, G 2017, 'Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials', SIAM Journal on Computing, vol. 46, no. 6, pp. 1893-1919. https://doi.org/10.1137/16M1101003","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1607.01167","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1607.01167","pdf_url":"https://arxiv.org/pdf/1607.01167","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:uvapub:oai:dare.uva.nl:publications/73e095ec-91b9-486d-8b98-1df98fb2c490","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/deterministic-polynomialtime-approximation-algorithms-for-partition-functions-and-graph-polynomials(73e095ec-91b9-486d-8b98-1df98fb2c490).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 46(6), 1893 - 1919. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.4230/lipics.ipec.2017.13","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2017.13","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1607.01167","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1607.01167","pdf_url":"https://arxiv.org/pdf/1607.01167","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3829048491","display_name":null,"funder_award_id":"FP7/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5702163051","display_name":null,"funder_award_id":"FP7/2007","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6334545473","display_name":null,"funder_award_id":"334828","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7724334725","display_name":null,"funder_award_id":"FP7/2007-2013","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8454853383","display_name":"Parameterized complexity and the search for tight complexity results","funder_award_id":"280152","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2474151873.pdf","grobid_xml":"https://content.openalex.org/works/W2474151873.grobid-xml"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W8433564","https://openalex.org/W9125994","https://openalex.org/W93786605","https://openalex.org/W1541384556","https://openalex.org/W1548726646","https://openalex.org/W1604555488","https://openalex.org/W1682699604","https://openalex.org/W1754421315","https://openalex.org/W1813508417","https://openalex.org/W1824395173","https://openalex.org/W1968334723","https://openalex.org/W1976445742","https://openalex.org/W1982356654","https://openalex.org/W1986979529","https://openalex.org/W1991832118","https://openalex.org/W1997999115","https://openalex.org/W2003722559","https://openalex.org/W2004724832","https://openalex.org/W2009768419","https://openalex.org/W2013439277","https://openalex.org/W2017186918","https://openalex.org/W2017226731","https://openalex.org/W2024710200","https://openalex.org/W2040145343","https://openalex.org/W2044145837","https://openalex.org/W2047290604","https://openalex.org/W2054043146","https://openalex.org/W2068524660","https://openalex.org/W2071824433","https://openalex.org/W2096626276","https://openalex.org/W2109260999","https://openalex.org/W2118223706","https://openalex.org/W2122925607","https://openalex.org/W2132049419","https://openalex.org/W2134355190","https://openalex.org/W2157869188","https://openalex.org/W2322832047","https://openalex.org/W2503719249","https://openalex.org/W2570207426","https://openalex.org/W2585507481","https://openalex.org/W2585810832","https://openalex.org/W2607730504","https://openalex.org/W2735792301","https://openalex.org/W2950334461","https://openalex.org/W2952745410","https://openalex.org/W2962684356","https://openalex.org/W2962992138","https://openalex.org/W2962998907","https://openalex.org/W2963152259","https://openalex.org/W2963364787","https://openalex.org/W2963476812","https://openalex.org/W2963721130","https://openalex.org/W2963793606","https://openalex.org/W2963958955","https://openalex.org/W3041052648","https://openalex.org/W3081001064","https://openalex.org/W3105627268","https://openalex.org/W3124123742","https://openalex.org/W4240841316","https://openalex.org/W4247670824","https://openalex.org/W4298377312","https://openalex.org/W4301794777","https://openalex.org/W4376848327"],"related_works":["https://openalex.org/W4280505073","https://openalex.org/W2032055415","https://openalex.org/W4226315870","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337","https://openalex.org/W2013377300"],"abstract_inverted_index":{"In":[0,29],"this":[1],"paper":[2],"we":[3,54],"show":[4,65,141],"a":[5,19,56,74,109,151,177,191],"new":[6,142,192],"way":[7],"of":[8,18,22,46,59,105,126,128,134,154,176,211],"constructing":[9],"deterministic":[10,110],"polynomial-time":[11,111],"approximation":[12,112,136],"algorithms":[13],"for":[14,34,92,99,114,208],"computing":[15],"complex-valued":[16,47],"evaluations":[17],"large":[20,57],"class":[21,58],"graph":[23,60,129],"polynomials":[24,61,130],"on":[25,90,150,179],"bounded":[26,94],"degree":[27,95],"graphs.":[28],"particular,":[30],"our":[31],"approach":[32,194],"works":[33],"the":[35,81,103,132,173,180,196,204],"Tutte":[36],"polynomial":[37],"and":[38,49,64,71,131,203],"independence":[39],"polynomial,":[40],"as":[41,43],"well":[42],"partition":[44],"functions":[45],"spin":[48],"edge-coloring":[50],"models.":[51],"More":[52],"specifically,":[53],"define":[55],"$\\mathcal":[62],"C$":[63,70],"that":[66,85],"if":[67],"$p\\in":[68],"\\cal":[69],"there":[72,107],"is":[73],"disk":[75],"$D$":[76,91,106],"centered":[77],"at":[78,117],"zero":[79],"in":[80,102],"complex":[82],"plane":[83],"such":[84],"$p(G)$":[86,116],"does":[87],"not":[88],"vanish":[89],"all":[93],"graphs":[96],"$G$,":[97],"then":[98],"each":[100],"$z$":[101],"interior":[104],"exists":[108],"algorithm":[113],"evaluating":[115],"$z$.":[118],"This":[119],"gives":[120],"an":[121],"explicit":[122],"connection":[123],"between":[124,144],"absence":[125],"zeros":[127],"existence":[133],"efficient":[135],"algorithms,":[137],"allowing":[138],"us":[139],"to":[140],"relationships":[143],"well-known":[145],"conjectures.":[146],"Our":[147],"work":[148,155],"builds":[149],"recent":[152],"line":[153],"initiated":[156],"by":[157],"Barvinok":[158],"[Found.":[159],"Comput.":[160],"Math.,":[161],"16":[162],"(2016),":[163],"pp.":[164,170],"329--342;":[165],"Theory":[166],"Comput.,":[167],"11":[168],"(2015),":[169],"339--355;":[171],"Computing":[172],"Partition":[174],"Function":[175],"Polynomial":[178],"Boolean":[181],"Cube,":[182],"2015;":[183],"Discrete":[184],"Anal.,":[185],"2":[186],"(2017),":[187],"34pp],":[188],"which":[189],"provides":[190],"algorithmic":[193],"besides":[195],"existing":[197],"Markov":[198],"chain":[199],"Monte":[200],"Carlo":[201],"method":[202,207],"correlation":[205],"decay":[206],"these":[209],"types":[210],"problems.":[212]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2020-11-23T00:00:00"}