{"id":"https://openalex.org/W2169488047","doi":"https://doi.org/10.1145/2462896.2462897","title":"On the usefulness of predicates","display_name":"On the usefulness of predicates","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2169488047","doi":"https://doi.org/10.1145/2462896.2462897","mag":"2169488047"},"language":"en","primary_location":{"id":"doi:10.1145/2462896.2462897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462896.2462897","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI","SE"],"is_corresponding":false,"raw_author_name":"Per Austrin","raw_affiliation_strings":["Aalto University and KTH Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aalto University and KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016","https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":["KTH Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1033,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.95787755,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"24"},"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.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/T10142","display_name":"Formal Methods in Verification","score":0.9923999905586243,"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/predicate","display_name":"Predicate (mathematical logic)","score":0.6918607950210571},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5872546434402466},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5319638252258301},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5035931468009949},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4660201072692871},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.46140187978744507},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.4516368508338928},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4365387558937073},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.42401808500289917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3484814167022705}],"concepts":[{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6918607950210571},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5872546434402466},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5319638252258301},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5035931468009949},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4660201072692871},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.46140187978744507},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.4516368508338928},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4365387558937073},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.42401808500289917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3484814167022705},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2462896.2462897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462896.2462897","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4753869397","display_name":null,"funder_award_id":"226203","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W436674831","https://openalex.org/W1530739071","https://openalex.org/W1665118812","https://openalex.org/W1967935161","https://openalex.org/W1973898585","https://openalex.org/W1997512277","https://openalex.org/W1999032440","https://openalex.org/W2008724760","https://openalex.org/W2078929687","https://openalex.org/W2081684569","https://openalex.org/W2083360043","https://openalex.org/W2087964954","https://openalex.org/W2091921997","https://openalex.org/W2095933180","https://openalex.org/W2097823813","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2125534993","https://openalex.org/W2129025918","https://openalex.org/W2133344054","https://openalex.org/W2154276597","https://openalex.org/W2167681887","https://openalex.org/W2179897858","https://openalex.org/W2405285952","https://openalex.org/W2953223971"],"related_works":["https://openalex.org/W2059922809","https://openalex.org/W3034924094","https://openalex.org/W3094954546","https://openalex.org/W1488708774","https://openalex.org/W1982811510","https://openalex.org/W2387527986","https://openalex.org/W4391100477","https://openalex.org/W2479250593","https://openalex.org/W2402189625","https://openalex.org/W4327779705"],"abstract_inverted_index":{"Motivated":[0],"by":[1,39,188,212],"the":[2,28,34,54,65,97,104,125,158,180,189,196,232,236,244,252,263,280],"pervasiveness":[3],"of":[4,15,19,36,53,68,107,112,167,208,235,282],"strong":[5],"inapproximability":[6],"results":[7,273],"for":[8,74,117,133,147],"Max-CSPs,":[9],"we":[10,63,201,256,269],"introduce":[11,64],"a":[12,20,69,75,93,113,118,203,213,216,226,258],"relaxed":[13,24],"notion":[14,67,111],"an":[16,37,81,89,163,176],"approximate":[17],"solution":[18],"Max-CSP.":[21],"In":[22],"this":[23],"version,":[25],"loosely":[26],"speaking,":[27],"algorithm":[29,90,116],"is":[30,88,123,131,140,144,172,191,218,225,239],"allowed":[31,250],"to":[32,49,103,154,157,174,241],"replace":[33],"constraints":[35,56],"instance":[38,101,166,190],"some":[40,272],"other":[41],"(possibly":[42],"real-valued)":[43],"constraints,":[44],"and":[45,205,221,255,274],"then":[46],"only":[47,222],"needs":[48],"satisfy":[50],"as":[51,57,127,266],"many":[52],"new":[55],"possible.":[58],"To":[59],"be":[60,155],"more":[61],"precise,":[62],"following":[66,159],"predicate":[70,121],"P":[71,85,122,130,134,139,169],"being":[72],"useful":[73,132,146,209],"(real-valued)":[76],"objective":[77],"Q":[78,100,149],":":[79],"given":[80,162],"almost":[82,164],"satisfiable":[83,165],"Max-":[84,99,168],"instance,":[86,254],"there":[87,224,265],"that":[91,129,138,179],"beats":[92],"random":[94],"assignment":[95,177],"on":[96,183,231,279],"corresponding":[98],"applied":[102],"same":[105,126],"sets":[106],"literals.":[108],"The":[109],"standard":[110],"nontrivial":[114],"approximation":[115],"Max-CSP":[119,217],"with":[120],"exactly":[124],"saying":[128],"itself.":[135],"We":[136],"say":[137],"useless":[141,219],"if":[142,220,223],"it":[143,171],"not":[145,192],"any":[148],".":[150],"This":[151],"turns":[152],"out":[153],"equivalent":[156],"pseudo-randomness":[160],"property:":[161],",":[170,200],"hard":[173],"find":[175],"such":[178,215],"induced":[181],"distribution":[182,229],"k":[184],"-bit":[185],"strings":[186],"defined":[187,211],"essentially":[193],"uniform.":[194],"Under":[195],"unique":[197],"games":[198],"conjecture":[199],"give":[202],"complete":[204,260],"simple":[206],"characterization":[207,261],"Max-CSPs":[210],"predicate:":[214],"pairwise":[227],"independent":[228],"supported":[230],"satisfying":[233],"assignments":[234],"predicate.":[237],"It":[238],"natural":[240],"also":[242,270],"consider":[243],"case":[245],"when":[246],"no":[247],"negations":[248],"are":[249],"in":[251],"CSP":[253],"derive":[257],"similar":[259],"(under":[262],"UGC)":[264],"well.":[267],"Finally,":[268],"include":[271],"examples":[275],"shedding":[276],"additional":[277],"light":[278],"approximability":[281],"certain":[283],"Max-CSPs.":[284]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}