{"id":"https://openalex.org/W3137920215","doi":"https://doi.org/10.1145/3457588.3457598","title":"Guest Column","display_name":"Guest Column","publication_year":2021,"publication_date":"2021-03-16","ids":{"openalex":"https://openalex.org/W3137920215","doi":"https://doi.org/10.1145/3457588.3457598","mag":"3137920215"},"language":"en","primary_location":{"id":"doi:10.1145/3457588.3457598","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3457588.3457598","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"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 SIGACT News","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/A5081609749","display_name":"Rafael Pass","orcid":"https://orcid.org/0000-0001-7440-5690"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Pass","raw_affiliation_strings":["Cornell Tech, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell Tech, New York, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087774653","display_name":"Muthuramakrishnan Venkitasubramaniam","orcid":"https://orcid.org/0000-0001-9765-7911"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Venkitasubramaniam","raw_affiliation_strings":["University of Rochester, Rochester, NY, USA"],"affiliations":[{"raw_affiliation_string":"University of Rochester, Rochester, NY, USA","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081609749"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06443548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"52","issue":"1","first_page":"47","last_page":"69"},"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.9994000196456909,"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.9994000196456909,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9983000159263611,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9969000220298767,"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/bounded-function","display_name":"Bounded function","score":0.7040736675262451},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6379597187042236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.564022958278656},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.5600665807723999},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5427402257919312},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.524231493473053},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5118634104728699},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46449732780456543},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46137580275535583},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44958001375198364},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41310763359069824},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38146257400512695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35267671942710876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3271034061908722},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3125312328338623},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2001488208770752},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1108805239200592}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7040736675262451},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6379597187042236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.564022958278656},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.5600665807723999},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5427402257919312},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.524231493473053},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5118634104728699},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46449732780456543},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46137580275535583},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44958001375198364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41310763359069824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38146257400512695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35267671942710876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3271034061908722},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3125312328338623},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2001488208770752},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1108805239200592},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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.1145/3457588.3457598","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3457588.3457598","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"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 SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W25285532","https://openalex.org/W151682908","https://openalex.org/W1487051037","https://openalex.org/W1548880861","https://openalex.org/W1569530622","https://openalex.org/W1970259241","https://openalex.org/W1970606468","https://openalex.org/W1972792640","https://openalex.org/W1974751157","https://openalex.org/W1977165845","https://openalex.org/W1980813953","https://openalex.org/W1998918799","https://openalex.org/W2005097301","https://openalex.org/W2010699490","https://openalex.org/W2011112377","https://openalex.org/W2014898899","https://openalex.org/W2015880590","https://openalex.org/W2021736779","https://openalex.org/W2023815950","https://openalex.org/W2026957673","https://openalex.org/W2044667552","https://openalex.org/W2047256651","https://openalex.org/W2057913812","https://openalex.org/W2062965695","https://openalex.org/W2067047774","https://openalex.org/W2067109782","https://openalex.org/W2074594718","https://openalex.org/W2074876220","https://openalex.org/W2078472124","https://openalex.org/W2082647621","https://openalex.org/W2098324348","https://openalex.org/W2100008268","https://openalex.org/W2107993699","https://openalex.org/W2131798840","https://openalex.org/W2148888468","https://openalex.org/W2148957455","https://openalex.org/W2156186849","https://openalex.org/W2158596367","https://openalex.org/W2159841662","https://openalex.org/W2160900264","https://openalex.org/W2161714146","https://openalex.org/W2165403591","https://openalex.org/W2165813048","https://openalex.org/W2169359757","https://openalex.org/W2173249896","https://openalex.org/W2293988196","https://openalex.org/W2294439931","https://openalex.org/W2560686414","https://openalex.org/W2913714934","https://openalex.org/W2998808137","https://openalex.org/W3022653612","https://openalex.org/W3154016153","https://openalex.org/W3171326915","https://openalex.org/W4210300416","https://openalex.org/W4213350211","https://openalex.org/W4241584151","https://openalex.org/W4285617425"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W2181722423","https://openalex.org/W2115480761","https://openalex.org/W4386614288","https://openalex.org/W2920896101","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W1983171306"],"abstract_inverted_index":{"We":[0,64],"review":[1,30],"a":[2,16,31,43],"study":[3],"of":[4,10,50,71,85],"average-case":[5,73],"complexity":[6],"through":[7],"the":[8,69,83],"lens":[9],"interactive":[11,13],"puzzles-":[12],"games":[14],"between":[15],"computationally":[17],"bounded":[18],"Challenger":[19],"and":[20],"computationally-bounded":[21],"Solver/Attacker.":[22],"Most":[23],"notably,":[24],"we":[25],"use":[26],"this":[27],"treatment":[28],"to":[29,68],"recent":[32],"result":[33],"showing":[34],"that":[35],"if":[36],"NP":[37,52,76],"is":[38],"hard-on-the-average,":[39],"then":[40],"there":[41],"exists":[42],"sampleable":[44],"distribution":[45],"over":[46],"only":[47],"true":[48],"statements":[49],"an":[51],"language,":[53],"for":[54],"which":[55],"no":[56],"probabilistic":[57],"polynomial":[58],"time":[59],"algorithm":[60],"can":[61],"find":[62],"witnesses.":[63],"also":[65],"discuss":[66],"connections":[67],"problem":[70],"whether":[72],"hardness":[74,79],"in":[75,80],"implies":[77],"averagecase":[78],"TFNP,":[81],"or":[82],"existence":[84],"cryptographic":[86],"one-way":[87],"functions.":[88]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-03-29T00:00:00"}