{"id":"https://openalex.org/W4240841316","doi":"https://doi.org/10.1007/978-3-540-27836-8_27","title":"The Complexity of Partition Functions","display_name":"The Complexity of Partition Functions","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4240841316","doi":"https://doi.org/10.1007/978-3-540-27836-8_27"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27836-8_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27836-8_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5103266587","display_name":"Andre\u01d0 A. Bulatov","orcid":"https://orcid.org/0000-0002-5516-1704"},"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":true,"raw_author_name":"Andrei Bulatov","raw_affiliation_strings":["Computing Laboratory, University of Oxford, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103266587"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6518,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.8546834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"294","last_page":"306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9983999729156494,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983000159263611,"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/adjacency-matrix","display_name":"Adjacency matrix","score":0.5678462982177734},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5662895441055298},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5539224147796631},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5527492761611938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5419244766235352},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.49525800347328186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4771285057067871},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47540363669395447},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4749215543270111},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.44296568632125854},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4246959984302521},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.41345635056495667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3775671124458313},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33112502098083496},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07876333594322205}],"concepts":[{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5678462982177734},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5662895441055298},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5539224147796631},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5527492761611938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5419244766235352},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.49525800347328186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4771285057067871},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47540363669395447},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4749215543270111},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.44296568632125854},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4246959984302521},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.41345635056495667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3775671124458313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33112502098083496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07876333594322205},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-27836-8_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27836-8_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1545819195","https://openalex.org/W1606916541","https://openalex.org/W1825515612","https://openalex.org/W2039763834","https://openalex.org/W2040145343","https://openalex.org/W2077575555","https://openalex.org/W2091345559","https://openalex.org/W2116407296","https://openalex.org/W2122772637","https://openalex.org/W2129023820","https://openalex.org/W2134850460","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2322336335","https://openalex.org/W4240841316","https://openalex.org/W4253538798","https://openalex.org/W4293860921"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2982430984","https://openalex.org/W2059018062","https://openalex.org/W2078477160","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W1989103179","https://openalex.org/W2117632582","https://openalex.org/W2604585036"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}