{"id":"https://openalex.org/W1984030644","doi":"https://doi.org/10.1016/s0168-0072(01)00052-5","title":"MAX SAT approximation beyond the limits of polynomial-time approximation","display_name":"MAX SAT approximation beyond the limits of polynomial-time approximation","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W1984030644","doi":"https://doi.org/10.1016/s0168-0072(01)00052-5","mag":"1984030644"},"language":"en","primary_location":{"id":"doi:10.1016/s0168-0072(01)00052-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0168-0072(01)00052-5","pdf_url":null,"source":{"id":"https://openalex.org/S172477885","display_name":"Annals of Pure and Applied Logic","issn_l":"0168-0072","issn":["0168-0072","1873-2461"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Pure and Applied Logic","raw_type":"journal-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/A5020126431","display_name":"Evgeny Dantsin","orcid":"https://orcid.org/0000-0002-8753-0279"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Evgeny Dantsin","raw_affiliation_strings":["Department of Computer Science, University of Manchester, UK","Department of Computer Science, University of Manchester, , UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manchester, UK","institution_ids":["https://openalex.org/I28407311"]},{"raw_affiliation_string":"Department of Computer Science, University of Manchester, , UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113540562","display_name":"Michael Gavrilovich","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Michael Gavrilovich","raw_affiliation_strings":["St. Petersburg State University, Russia","St Petersburg State University, Russia#TAB#"],"affiliations":[{"raw_affiliation_string":"St. Petersburg State University, Russia","institution_ids":["https://openalex.org/I172901346"]},{"raw_affiliation_string":"St Petersburg State University, Russia#TAB#","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035077817","display_name":"Edward Hirsch","orcid":null},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Edward A. Hirsch","raw_affiliation_strings":["Steklov Institute of Mathematics, St. Petersburg, Russia","[Steklov Institute of Mathematics, St. Petersburg, Russia]"],"affiliations":[{"raw_affiliation_string":"Steklov Institute of Mathematics, St. Petersburg, Russia","institution_ids":["https://openalex.org/I2800906181"]},{"raw_affiliation_string":"[Steklov Institute of Mathematics, St. Petersburg, Russia]","institution_ids":["https://openalex.org/I2800906181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032067568","display_name":"Boris Konev","orcid":"https://orcid.org/0000-0002-6507-0494"},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Boris Konev","raw_affiliation_strings":["Steklov Institute of Mathematics, St. Petersburg, Russia","[Steklov Institute of Mathematics, St. Petersburg, Russia]"],"affiliations":[{"raw_affiliation_string":"Steklov Institute of Mathematics, St. Petersburg, Russia","institution_ids":["https://openalex.org/I2800906181"]},{"raw_affiliation_string":"[Steklov Institute of Mathematics, St. Petersburg, Russia]","institution_ids":["https://openalex.org/I2800906181"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020126431"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":{"value":3390,"currency":"USD","value_usd":3390},"apc_paid":null,"fwci":2.7394,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.89349677,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"113","issue":"1-3","first_page":"81","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958999752998352,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.7233577370643616},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7070480585098267},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5665064454078674},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5572846531867981},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5116327404975891},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5013871192932129},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4924517571926117},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.48978567123413086},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.46567246317863464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4464084506034851},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4331415891647339},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.432658851146698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3434692621231079},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1318422257900238},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1024111807346344}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7233577370643616},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7070480585098267},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5665064454078674},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5572846531867981},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5116327404975891},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5013871192932129},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4924517571926117},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.48978567123413086},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.46567246317863464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4464084506034851},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4331415891647339},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.432658851146698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3434692621231079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1318422257900238},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1024111807346344},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0168-0072(01)00052-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0168-0072(01)00052-5","pdf_url":null,"source":{"id":"https://openalex.org/S172477885","display_name":"Annals of Pure and Applied Logic","issn_l":"0168-0072","issn":["0168-0072","1873-2461"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Pure and Applied Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.332.5168","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.5168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.roosevelt.edu/~dantsin/research/pdf/DGHK01.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W9190679","https://openalex.org/W17690413","https://openalex.org/W96391780","https://openalex.org/W1564428908","https://openalex.org/W1581661059","https://openalex.org/W1784269369","https://openalex.org/W1883558934","https://openalex.org/W1896404939","https://openalex.org/W1965762037","https://openalex.org/W1985123706","https://openalex.org/W1990313671","https://openalex.org/W2001013631","https://openalex.org/W2006933117","https://openalex.org/W2014111643","https://openalex.org/W2057361103","https://openalex.org/W2087226760","https://openalex.org/W2109039359","https://openalex.org/W2126442135","https://openalex.org/W2137373403","https://openalex.org/W2154474334"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W1443174385","https://openalex.org/W2110817230","https://openalex.org/W1606488336","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}