{"id":"https://openalex.org/W2963721130","doi":"https://doi.org/10.1007/s00037-017-0162-2","title":"The Complexity of Approximating complex-valued Ising and Tutte partition functions","display_name":"The Complexity of Approximating complex-valued Ising and Tutte partition functions","publication_year":2017,"publication_date":"2017-09-13","ids":{"openalex":"https://openalex.org/W2963721130","doi":"https://doi.org/10.1007/s00037-017-0162-2","mag":"2963721130"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-017-0162-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-017-0162-2","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/files/46920390/ComplexIsing_CC.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029293569","display_name":"Leslie Ann Goldberg","orcid":"https://orcid.org/0000-0003-1879-6089"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leslie Ann Goldberg","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Oxford, OX1 3QD, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Oxford, OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100354396","display_name":"Heng Guo","orcid":"https://orcid.org/0000-0001-8199-5596"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Heng Guo","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Informatics Forum, Edinburgh, EH8 9AB, UK"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Informatics Forum, Edinburgh, EH8 9AB, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100354396"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.9464,"has_fulltext":true,"cited_by_count":52,"citation_normalized_percentile":{"value":0.95080086,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"26","issue":"4","first_page":"765","last_page":"833"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ising-model","display_name":"Ising model","score":0.827477753162384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.654340386390686},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5460762977600098},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49677830934524536},{"id":"https://openalex.org/keywords/partition-function","display_name":"Partition function (quantum field theory)","score":0.49161702394485474},{"id":"https://openalex.org/keywords/tutte-polynomial","display_name":"Tutte polynomial","score":0.4661753177642822},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4410000443458557},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43935900926589966},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.41806966066360474},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4150468111038208},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41300103068351746},{"id":"https://openalex.org/keywords/statistical-physics","display_name":"Statistical physics","score":0.212407648563385},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.12433964014053345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11550077795982361},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07628819346427917}],"concepts":[{"id":"https://openalex.org/C51329190","wikidata":"https://www.wikidata.org/wiki/Q1076349","display_name":"Ising model","level":2,"score":0.827477753162384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.654340386390686},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5460762977600098},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49677830934524536},{"id":"https://openalex.org/C2778401447","wikidata":"https://www.wikidata.org/wiki/Q7140637","display_name":"Partition function (quantum field theory)","level":2,"score":0.49161702394485474},{"id":"https://openalex.org/C14447369","wikidata":"https://www.wikidata.org/wiki/Q7857002","display_name":"Tutte polynomial","level":5,"score":0.4661753177642822},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4410000443458557},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43935900926589966},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.41806966066360474},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4150468111038208},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41300103068351746},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.212407648563385},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.12433964014053345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11550077795982361},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07628819346427917},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-017-0162-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-017-0162-2","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/a7962694-1170-4f9b-adc5-6004b3855676","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a7962694-1170-4f9b-adc5-6004b3855676","pdf_url":"https://www.research.ed.ac.uk/files/46920390/ComplexIsing_CC.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goldberg, L A & Guo, H 2017, 'The Complexity of Approximating complex-valued Ising and Tutte partition functions', Computational complexity, vol. 26, no. 4, pp. 765\u2013833. https://doi.org/10.1007/s00037-017-0162-2","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/a7962694-1170-4f9b-adc5-6004b3855676","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a7962694-1170-4f9b-adc5-6004b3855676","pdf_url":"https://www.research.ed.ac.uk/files/46920390/ComplexIsing_CC.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goldberg, L A & Guo, H 2017, 'The Complexity of Approximating complex-valued Ising and Tutte partition functions', Computational complexity, vol. 26, no. 4, pp. 765\u2013833. https://doi.org/10.1007/s00037-017-0162-2","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1197539974","display_name":null,"funder_award_id":"EP/N004221/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963721130.pdf","grobid_xml":"https://content.openalex.org/works/W2963721130.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W93786605","https://openalex.org/W1531965102","https://openalex.org/W1644178525","https://openalex.org/W1683743514","https://openalex.org/W1803292696","https://openalex.org/W1991632738","https://openalex.org/W1997590411","https://openalex.org/W1998076865","https://openalex.org/W2005028755","https://openalex.org/W2024710200","https://openalex.org/W2026428220","https://openalex.org/W2039763834","https://openalex.org/W2049672266","https://openalex.org/W2057512592","https://openalex.org/W2068033618","https://openalex.org/W2069280326","https://openalex.org/W2069632988","https://openalex.org/W2071963215","https://openalex.org/W2072467734","https://openalex.org/W2097087591","https://openalex.org/W2119968904","https://openalex.org/W2122765404","https://openalex.org/W2128785157","https://openalex.org/W2137335992","https://openalex.org/W2158764863","https://openalex.org/W2164171842","https://openalex.org/W2611715903","https://openalex.org/W2949110438","https://openalex.org/W2962824725","https://openalex.org/W2964317026","https://openalex.org/W3100391894","https://openalex.org/W3100618339","https://openalex.org/W3100622006","https://openalex.org/W3103241859","https://openalex.org/W3103520888","https://openalex.org/W4300020039"],"related_works":["https://openalex.org/W3209539671","https://openalex.org/W2787138325","https://openalex.org/W1985264093","https://openalex.org/W2756039007","https://openalex.org/W2944617580","https://openalex.org/W2020029493","https://openalex.org/W2067003740","https://openalex.org/W2382664089","https://openalex.org/W2034612530","https://openalex.org/W4288357902"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}