{"id":"https://openalex.org/W2010124699","doi":"https://doi.org/10.1145/2421119.2421135","title":"SIGACT News Complexity Theory Column 76","display_name":"SIGACT News Complexity Theory Column 76","publication_year":2012,"publication_date":"2012-12-19","ids":{"openalex":"https://openalex.org/W2010124699","doi":"https://doi.org/10.1145/2421119.2421135","mag":"2010124699"},"language":"en","primary_location":{"id":"doi:10.1145/2421119.2421135","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2421119.2421135","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/A5088546793","display_name":"Lane A. Hemaspaandra","orcid":"https://orcid.org/0000-0003-0659-5204"},"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":"Lane A. Hemaspaandra","raw_affiliation_strings":["University of Rochester, Rochester, NY","University of Rochester; Rochester, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rochester, Rochester, NY","institution_ids":["https://openalex.org/I5388228"]},{"raw_affiliation_string":"University of Rochester; Rochester, NY","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Williams","raw_affiliation_strings":["Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3799,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.88440373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"43","issue":"4","first_page":"70","last_page":"89"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"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/heuristics","display_name":"Heuristics","score":0.8933402299880981},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7529197931289673},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7471928596496582},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6333106160163879},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5822966694831848},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45658889412879944},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44987761974334717},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42860448360443115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3518787622451782},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18813923001289368}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8933402299880981},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7529197931289673},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7471928596496582},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6333106160163879},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5822966694831848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45658889412879944},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44987761974334717},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42860448360443115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3518787622451782},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18813923001289368},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2421119.2421135","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2421119.2421135","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W24139812","https://openalex.org/W138629619","https://openalex.org/W203718333","https://openalex.org/W577173724","https://openalex.org/W1493942848","https://openalex.org/W1502951011","https://openalex.org/W1516895011","https://openalex.org/W1559732456","https://openalex.org/W1595428830","https://openalex.org/W1709155369","https://openalex.org/W1732327014","https://openalex.org/W1864424315","https://openalex.org/W1868133269","https://openalex.org/W1970089350","https://openalex.org/W1971691873","https://openalex.org/W1971724037","https://openalex.org/W1986203294","https://openalex.org/W1986448430","https://openalex.org/W1996192734","https://openalex.org/W1996660205","https://openalex.org/W2008772536","https://openalex.org/W2011039300","https://openalex.org/W2011367000","https://openalex.org/W2023336906","https://openalex.org/W2026036943","https://openalex.org/W2028861117","https://openalex.org/W2036322072","https://openalex.org/W2039334189","https://openalex.org/W2039982637","https://openalex.org/W2040185013","https://openalex.org/W2041316638","https://openalex.org/W2044722214","https://openalex.org/W2049516232","https://openalex.org/W2059442002","https://openalex.org/W2060270693","https://openalex.org/W2066804259","https://openalex.org/W2069767473","https://openalex.org/W2072802070","https://openalex.org/W2084384424","https://openalex.org/W2090186532","https://openalex.org/W2090841650","https://openalex.org/W2091536492","https://openalex.org/W2099666280","https://openalex.org/W2100008268","https://openalex.org/W2106623697","https://openalex.org/W2116887008","https://openalex.org/W2119190805","https://openalex.org/W2139534251","https://openalex.org/W2146667376","https://openalex.org/W2147148915","https://openalex.org/W2153417364","https://openalex.org/W2156369551","https://openalex.org/W2162716966","https://openalex.org/W2163565002","https://openalex.org/W2403039919","https://openalex.org/W2951177312","https://openalex.org/W3126731212","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2887599639","https://openalex.org/W39738311","https://openalex.org/W1837670361","https://openalex.org/W2151178082","https://openalex.org/W2353139202","https://openalex.org/W2154400062","https://openalex.org/W2389663662","https://openalex.org/W1877508920","https://openalex.org/W2169642848","https://openalex.org/W4299576468"],"abstract_inverted_index":{"Heuristic":[0],"approaches":[1],"often":[2],"do":[3,70],"so":[4],"well":[5,66],"that":[6,136],"they":[7],"seem":[8],"to":[9,23],"pretty":[10],"much":[11],"always":[12,24],"give":[13],"the":[14,26,54,58,132],"right":[15,27],"answer.":[16],"How":[17],"close":[18],"can":[19,69,113,129],"heuristic":[20,67,80],"algorithms":[21,68],"get":[22],"giving":[25],"answer,":[28],"without":[29],"inducing":[30],"seismic":[31],"complexity-theoretic":[32],"consequences?":[33],"This":[34],"article":[35],"first":[36],"discusses":[37],"how":[38,65,104],"a":[39,115],"series":[40],"of":[41,79,119,134],"results":[42],"by":[43,98],"Berman,":[44],"Buhrman,":[45],"Hartmanis,":[46],"Homer,":[47],"Longpr\u00e9,":[48],"Ogiwara,":[49],"Sch\u00f6ning,":[50],"and":[51,100],"Watanabe,":[52],"from":[53],"early":[55,59],"1970s":[56],"through":[57],"1990s,":[60],"explicitly":[61],"or":[62],"implicitly":[63],"limited":[64],"on":[71],"NP-hard":[72,138],"problems.":[73],"In":[74],"particular,":[75],"many":[76],"desirable":[77],"levels":[78],"success":[81],"cannot":[82],"be":[83],"obtained":[84],"unless":[85],"severe,":[86],"highly":[87],"unlikely":[88],"complexity":[89],"class":[90],"collapses":[91],"occur.":[92],"Second,":[93],"we":[94,122],"survey":[95],"work":[96],"initiated":[97],"Goldreich":[99],"Wigderson,":[101],"who":[102],"showed":[103],"under":[105],"plausible":[106],"assumptions":[107],"deterministic":[108],"heuristics":[109,135],"for":[110],"randomized":[111],"computation":[112],"achieve":[114],"very":[116],"high":[117],"frequency":[118],"correctness.":[120],"Finally,":[121],"consider":[123],"formal":[124],"ways":[125],"in":[126,140],"which":[127],"theory":[128],"help":[130],"explain":[131],"effectiveness":[133],"solve":[137],"problems":[139],"practice.":[141]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}