{"id":"https://openalex.org/W1602724486","doi":"https://doi.org/10.1007/978-3-540-74510-5_20","title":"Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems","display_name":"Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems","publication_year":2007,"publication_date":"2007-08-21","ids":{"openalex":"https://openalex.org/W1602724486","doi":"https://doi.org/10.1007/978-3-540-74510-5_20","mag":"1602724486"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74510-5_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74510-5_20","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/A5101920004","display_name":"Peter J\u00f6nsson","orcid":"https://orcid.org/0000-0002-5288-3330"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Jonsson","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6pings Universitet, SE-581 83, Link\u00f6ping, Sweden","Dept. of Comput. & Inf. Sci., Linkopings Universitet, Linkoping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6pings Universitet, SE-581 83, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Dept. of Comput. & Inf. Sci., Linkopings Universitet, Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003558662","display_name":"Andrei Krokhin","orcid":"https://orcid.org/0000-0003-4373-8227"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrei Krokhin","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, DH1 3LE, UK","Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, DH1 3LE, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065121720","display_name":"Fredrik Kuivinen","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Fredrik Kuivinen","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6pings Universitet, SE-581 83, Link\u00f6ping, Sweden","Dept. of Comput. & Inf. Sci., Linkopings Universitet, Linkoping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6pings Universitet, SE-581 83, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Dept. of Comput. & Inf. Sci., Linkopings Universitet, Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101920004"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6688,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85221296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"182","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9952999949455261,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.993399977684021,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8484269380569458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6517450213432312},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6355262398719788},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6349702477455139},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5981297492980957},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5426157116889954},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.4996757507324219},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4464421570301056},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.44489967823028564},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4448928236961365},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43690240383148193},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4339751601219177},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.4269866943359375},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4167020916938782},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3702358603477478},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12278705835342407}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8484269380569458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6517450213432312},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6355262398719788},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6349702477455139},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5981297492980957},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5426157116889954},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.4996757507324219},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4464421570301056},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.44489967823028564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4448928236961365},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43690240383148193},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4339751601219177},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.4269866943359375},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4167020916938782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3702358603477478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12278705835342407},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"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.1007/978-3-540-74510-5_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74510-5_20","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W655258421","https://openalex.org/W1561229603","https://openalex.org/W1563287310","https://openalex.org/W1974691224","https://openalex.org/W1989905036","https://openalex.org/W1997649256","https://openalex.org/W2007582202","https://openalex.org/W2023648368","https://openalex.org/W2026753685","https://openalex.org/W2068190866","https://openalex.org/W2111739159","https://openalex.org/W2134850460","https://openalex.org/W2137560895","https://openalex.org/W2142884756","https://openalex.org/W2170491051","https://openalex.org/W2486715098","https://openalex.org/W2487140311","https://openalex.org/W2504299149","https://openalex.org/W2951429494","https://openalex.org/W3161056635","https://openalex.org/W4293176479","https://openalex.org/W6601945944"],"related_works":["https://openalex.org/W2784687883","https://openalex.org/W2012141606","https://openalex.org/W2137855809","https://openalex.org/W115413730","https://openalex.org/W1486916474","https://openalex.org/W2591224762","https://openalex.org/W2070692358","https://openalex.org/W2162117398","https://openalex.org/W2038330280","https://openalex.org/W2556942700"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}