{"id":"https://openalex.org/W2285377536","doi":"https://doi.org/10.4086/toc.2013.v009a022","title":"","display_name":"","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2285377536","doi":"https://doi.org/10.4086/toc.2013.v009a022","mag":"2285377536"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2013.v009a022","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a022","pdf_url":"https://theoryofcomputing.org/articles/v009a022/v009a022.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v009a022/v009a022.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Daniel Sheldon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Sheldon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Neal E. Young","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neal E. Young","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3564,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68679391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"1","first_page":"685","last_page":"702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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/hamming-distance","display_name":"Hamming distance","score":0.8259999752044678},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.546500027179718},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.5302000045776367},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.46810001134872437},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.4092999994754791},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3749000132083893}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.8259999752044678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5781999826431274},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.546500027179718},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5443999767303467},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.5302000045776367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5206999778747559},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.46810001134872437},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.4092999994754791},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30000001192092896},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.25769999623298645},{"id":"https://openalex.org/C2776900844","wikidata":"https://www.wikidata.org/wiki/Q8028383","display_name":"Witness","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4086/toc.2013.v009a022","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a022","pdf_url":"https://theoryofcomputing.org/articles/v009a022/v009a022.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1208.0257","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1208.0257","pdf_url":"https://arxiv.org/pdf/1208.0257","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.4086/toc.2013.v009a022","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a022","pdf_url":"https://theoryofcomputing.org/articles/v009a022/v009a022.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1896852859","display_name":null,"funder_award_id":"IIS\u20101125098","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4003536310","display_name":"AF: Small: Nearly Linear-Time Algorithms for Mixed Packing and Covering Linear Programs","funder_award_id":"1117954","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6123884969","display_name":"Collaborative Research: CDI-Type II: BirdCast: Novel Machine Learning Methods for Understanding Continent-Scale Bird Migration","funder_award_id":"1125098","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2285377536.pdf","grobid_xml":"https://content.openalex.org/works/W2285377536.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1580365030","https://openalex.org/W1642409342","https://openalex.org/W1874167488","https://openalex.org/W2010029053","https://openalex.org/W2013415302","https://openalex.org/W2089688060","https://openalex.org/W2090186532","https://openalex.org/W2116231125"],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,24,57,88,115],"satisfiable":[2],"3-SAT":[3],"formula,":[4],"how":[5],"hard":[6],"is":[7,43,72,93,105],"it":[8],"to":[9,13,23,66],"find":[10],"an":[11],"assignment":[12],"the":[14,41,51,75,130],"variables":[15],"that":[16,117],"has":[17,87,114],"Hamming":[18,61],"distance":[19,62],"at":[20,63],"most":[21,64],"$n/2$":[22],"satisfying":[25],"assignment?":[26],"More":[27],"generally,":[28],"consider":[29,135],"any":[30,34,47,156],"polynomial-time":[31],"verifier":[32,42,89,116],"for":[33,40,90,97,138,155,163],"NP-complete":[35,85,112,141],"language.":[36],"A":[37],"$d(n)$-Hamming-approximation":[38],"algorithm":[39],"one":[44,125],"that,":[45,81,106],"given":[46],"member":[48],"$x$":[49],"of":[50],"language,":[52],"outputs":[53],"in":[54],"polynomial":[55],"time":[56],"string":[58],"$a$":[59],"with":[60],"$d(n)$":[65],"some":[67],"witness":[68],"$w$,":[69],"where":[70],"$(x,w)$":[71],"accepted":[73],"by":[74],"verifier.":[76],"Previous":[77],"results":[78,162],"have":[79,145,151],"shown":[80],"if":[82,107,149],"P$~\\ne~$NP,":[83,108,150],"every":[84,110],"language":[86,113],"which":[91],"there":[92],"no":[94,119,152],"$(n/2-n^{2/3+\\delta})$-Hamming-approximation":[95],"algorithm,":[96],"various":[98,139],"constants":[99],"$\\delta\\ge":[100],"0$.":[101],"Our":[102],"main":[103],"result":[104],"then":[109],"paddable":[111],"admits":[118],"$(n/2+O(\\sqrt{n\\log":[120],"n}))$-Hamming-approximation":[121],"algorithm.":[122],"That":[123],"is,":[124],"can't":[126],"get":[127],"even":[128],"half":[129],"bits":[131],"right.":[132],"We":[133,159],"also":[134],"natural":[136],"verifiers":[137],"well-known":[140],"problems.":[142],"They":[143],"do":[144],"$n/2$-Hamming-approximation":[146],"algorithms,":[147],"but,":[148],"$(n/2-n^\\epsilon)$-Hamming-approximation":[153],"algorithms":[154],"constant":[157],"$\\epsilon>0$.":[158],"show":[160],"similar":[161],"randomized":[164],"algorithms.":[165]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2016-06-24T00:00:00"}