{"id":"https://openalex.org/W1606502575","doi":"https://doi.org/10.1007/978-3-540-85363-3_7","title":"Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness","display_name":"Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness","publication_year":2008,"publication_date":"2008-08-27","ids":{"openalex":"https://openalex.org/W1606502575","doi":"https://doi.org/10.1007/978-3-540-85363-3_7","mag":"1606502575"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-85363-3_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85363-3_7","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":"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/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["Department of Computer Science & Engineering, University of Washington, Seattle, WA","Dept. of Computer Science & Engineering, University of Washington, Seattle#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Dept. of Computer Science & Engineering, University of Washington, Seattle#TAB#","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":["Department of Computer Science & Engineering, University of Washington, Seattle, WA","Dept. of Computer Science & Engineering, University of Washington, Seattle#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Dept. of Computer Science & Engineering, University of Washington, Seattle#TAB#","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068388812"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1249733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":null,"first_page":"77","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","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/T10237","display_name":"Cryptography and Data Security","score":0.9872000217437744,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7438821792602539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6642504930496216},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.6269832849502563},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5603073835372925},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.545585036277771},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5393282175064087},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.49447011947631836},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49210160970687866},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4915491044521332},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4799083173274994},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4738243818283081},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.46477583050727844},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4329407215118408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1253548562526703}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7438821792602539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6642504930496216},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.6269832849502563},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5603073835372925},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.545585036277771},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5393282175064087},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.49447011947631836},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49210160970687866},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4915491044521332},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4799083173274994},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4738243818283081},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.46477583050727844},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4329407215118408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1253548562526703},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-85363-3_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85363-3_7","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.2513","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.2513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~venkatg/pubs/papers/qaryCSP.pdf","raw_type":"text"},{"id":"mag:1606502575","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc15.html#GuruswamiR08","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W56772274","https://openalex.org/W105587991","https://openalex.org/W1490233153","https://openalex.org/W1530739071","https://openalex.org/W1577891761","https://openalex.org/W1967935161","https://openalex.org/W1975810219","https://openalex.org/W1992866589","https://openalex.org/W1993116423","https://openalex.org/W1999032440","https://openalex.org/W2064469747","https://openalex.org/W2087964954","https://openalex.org/W2091921997","https://openalex.org/W2095933180","https://openalex.org/W2110871651","https://openalex.org/W2115404728","https://openalex.org/W2127141092","https://openalex.org/W2137118456","https://openalex.org/W2149577432","https://openalex.org/W2165732281","https://openalex.org/W2169399056"],"related_works":["https://openalex.org/W2165967486","https://openalex.org/W2398042872","https://openalex.org/W1603194973","https://openalex.org/W2249596971","https://openalex.org/W1852633567","https://openalex.org/W2078140591","https://openalex.org/W112932804","https://openalex.org/W3037076685","https://openalex.org/W1523797563","https://openalex.org/W2949566597","https://openalex.org/W3131358129","https://openalex.org/W2555508936","https://openalex.org/W2395406102","https://openalex.org/W3168285534","https://openalex.org/W2952626533","https://openalex.org/W1519726742","https://openalex.org/W2528022101","https://openalex.org/W2026156613","https://openalex.org/W3177317318","https://openalex.org/W3172548086"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}