{"id":"https://openalex.org/W2171001107","doi":"https://doi.org/10.1109/sfcs.2003.1238204","title":"More on average case vs approximation complexity","display_name":"More on average case vs approximation complexity","publication_year":2004,"publication_date":"2004-02-03","ids":{"openalex":"https://openalex.org/W2171001107","doi":"https://doi.org/10.1109/sfcs.2003.1238204","mag":"2171001107"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238204","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-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/A5108227774","display_name":"M. Alekhnovich","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Alekhnovich","raw_affiliation_strings":["Laboratory for Computer Science, Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108227774"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.4573,"has_fulltext":false,"cited_by_count":233,"citation_normalized_percentile":{"value":0.9268319,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"298","last_page":"307"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6542344689369202},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6175932288169861},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5645481944084167},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5399690866470337},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5296475887298584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.507351815700531},{"id":"https://openalex.org/keywords/cryptosystem","display_name":"Cryptosystem","score":0.5057086944580078},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4939032196998596},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.48702722787857056},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4511498808860779},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44373413920402527},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4398537874221802},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24873605370521545}],"concepts":[{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6542344689369202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6175932288169861},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5645481944084167},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5399690866470337},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5296475887298584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.507351815700531},{"id":"https://openalex.org/C6295992","wikidata":"https://www.wikidata.org/wiki/Q976521","display_name":"Cryptosystem","level":3,"score":0.5057086944580078},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4939032196998596},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.48702722787857056},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4511498808860779},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44373413920402527},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4398537874221802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24873605370521545},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2003.1238204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238204","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1512682067","https://openalex.org/W1530008367","https://openalex.org/W1973270757","https://openalex.org/W1977195026","https://openalex.org/W1994098212","https://openalex.org/W1996146326","https://openalex.org/W1999032440","https://openalex.org/W2008671178","https://openalex.org/W2019578639","https://openalex.org/W2019807548","https://openalex.org/W2029734507","https://openalex.org/W2064269488","https://openalex.org/W2066465093","https://openalex.org/W2072802070","https://openalex.org/W2077244027","https://openalex.org/W2106699235","https://openalex.org/W2107271959","https://openalex.org/W2110053319","https://openalex.org/W2132302072","https://openalex.org/W2133527541","https://openalex.org/W2148352980","https://openalex.org/W2166026605","https://openalex.org/W2912080987","https://openalex.org/W2986959318","https://openalex.org/W3144422206","https://openalex.org/W4255293738","https://openalex.org/W6631785954","https://openalex.org/W6770380337"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W2963411648","https://openalex.org/W4299801389","https://openalex.org/W2952838392","https://openalex.org/W961142965","https://openalex.org/W2016001296"],"abstract_inverted_index":{"We":[0,19],"consider":[1],"the":[2,6,25,37,47,62,69,104,120,150,173,183],"problem":[3,31,174],"to":[4,42,102,118,130,182],"determine":[5],"maximal":[7],"number":[8],"of":[9,29,49,71,94,122,134,152,154,179,185,197],"satisfiable":[10],"equations":[11],"in":[12,46,53,79,162],"a":[13,73,84,123,143],"linear":[14],"system":[15],"chosen":[16],"at":[17],"random.":[18],"make":[20],"several":[21,43,87],"plausible":[22],"conjectures":[23,60,159],"about":[24,68],"average":[26],"case":[27],"hardness":[28,70,199],"this":[30],"for":[32,86,90],"some":[33],"natural":[34],"distributions":[35],"on":[36,149,175],"instances,":[38],"and":[39,52,137],"relate":[40],"them":[41],"interesting":[44],"questions":[45],"theory":[48],"approximation":[50,95],"algorithms":[51,190],"cryptography.":[54],"Namely":[55],"we":[56],"show":[57],"that":[58,163,194],"our":[59,186,198],"imply":[61],"following":[63],"facts:":[64],"(1)":[65],"Feige's":[66],"hypothesis":[67],"refuting":[72],"random":[74,138,155],"3CNF":[75],"is":[76,96,100,116,128],"true,":[77],"which":[78,91],"turn":[80],"implies":[81],"inapproximability":[82],"within":[83,107],"constant":[85],"combinatorial":[88],"problems,":[89],"no":[92,168,188],"NP-hardness":[93],"known.":[97],"(2)":[98],"It":[99,115],"hard":[101,117,129],"approximate":[103],"nearest":[105],"codeword":[106],"factor":[108],"n/sup":[109],"1":[110],"-":[111],"/spl":[112],"epsi//.":[113],"(3)":[114],"estimate":[119],"rigidity":[121,136],"matrix.":[124],"More":[125],"exactly,":[126],"it":[127],"distinguish":[131],"between":[132],"matrices":[133],"low":[135],"ones.":[139],"(4)":[140],"There":[141],"exists":[142],"secure":[144],"public-key":[145],"(probabilistic)":[146],"cryptosystem,":[147],"based":[148],"intractability":[151],"decoding":[153],"binary":[156],"codes.":[157],"Our":[158],"are":[160,191],"strong":[161],"they":[164],"assume":[165],"cryptographic":[166],"hardness:":[167],"polynomial":[169],"algorithm":[170],"can":[171],"solve":[172],"any":[176,196],"non-negligible":[177],"fraction":[178],"inputs.":[180],"Nevertheless,":[181],"best":[184],"knowledge":[187],"efficient":[189],"currently":[192],"known":[193],"refute":[195],"conjectures.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":31},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}