{"id":"https://openalex.org/W2054982957","doi":null,"title":"Hardness of Approximately Solving Linear Equations Over Reals.","display_name":"Hardness of Approximately Solving Linear Equations Over Reals.","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2054982957","mag":"2054982957"},"language":"en","primary_location":{"id":"mag:2054982957","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#MoshkovitzK10","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5023279342","display_name":"Dana Moshkovitz","orcid":"https://orcid.org/0000-0002-4151-568X","observed_orcids":["https://orcid.org/0000-0002-4151-568X"]},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dana Moshkovitz","raw_affiliation_strings":["New York University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New York University","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011","observed_orcids":["https://orcid.org/0009-0007-9246-4011"]},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["New York University"],"raw_orcid":"https://orcid.org/0009-0007-9246-4011","affiliations":[{"raw_affiliation_string":"New York University","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":null,"first_page":"53","last_page":null},"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.9628999829292297,"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.9628999829292297,"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.012299999594688416,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.00559999980032444,"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/homogeneous-linear-systems","display_name":"homogeneous linear systems","score":0.7229999899864197},{"id":"https://openalex.org/keywords/unique-games-conjecture","display_name":"Unique Games Conjecture","score":0.9350000023841858},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8130000233650208},{"id":"https://openalex.org/keywords/linearity-test","display_name":"linearity testing","score":0.6970000267028809},{"id":"https://openalex.org/keywords/gaussian-space","display_name":"Gaussian space","score":0.9639999866485596},{"id":"https://openalex.org/keywords/real-functions","display_name":"real functions","score":0.6119999885559082}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7537981271743774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6997393369674683},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.6752210855484009},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.619565486907959},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.48663076758384705},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.474896103143692},{"id":"https://openalex.org/C77346573","wikidata":"https://www.wikidata.org/wiki/Q484637","display_name":"Linear equation","level":2,"score":0.467083215713501},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.4544922709465027},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.45298466086387634},{"id":"https://openalex.org/C77170095","wikidata":"https://www.wikidata.org/wiki/Q1753188","display_name":"Linearity","level":2,"score":0.45050644874572754},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.41294926404953003},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4103701710700989},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3933110535144806},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.344529390335083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29683157801628113},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.23961597681045532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19022110104560852},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2054982957","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#MoshkovitzK10","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1564025554","https://openalex.org/W1997855358","https://openalex.org/W2010886177","https://openalex.org/W2087038607","https://openalex.org/W2087304636","https://openalex.org/W2120358419","https://openalex.org/W2155618818","https://openalex.org/W3004537778"],"related_works":["https://openalex.org/W1991143034","https://openalex.org/W1992771184","https://openalex.org/W2087304636","https://openalex.org/W2406600525","https://openalex.org/W7100743241","https://openalex.org/W7097834803","https://openalex.org/W1502009568","https://openalex.org/W7099588134","https://openalex.org/W7100373956","https://openalex.org/W7098440898"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,36],"consider":[4],"the":[5,27,33,38,52,73,86,129],"problem":[6],"of":[7,12,48,72,85,91,116],"approximately":[8],"solving":[9],"a":[10,64,82,89,110,124],"system":[11],"homogeneous":[13],"linear":[14],"equations":[15,34,74,87],"over":[16,109],"reals,":[17],"where":[18],"each":[19],"equation":[20],"contains":[21],"at":[22],"most":[23],"three":[24],"variables.":[25],"Since":[26],"all-zero":[28],"assignment":[29,66,78],"always":[30],"satisfies":[31,68],"all":[32],"exactly,":[35],"restrict":[37],"assignments":[39],"to":[40,59,80,127],"be":[41,115],"\u201cnon-trivial\u201d.":[42],"Here":[43],"is":[44,57,63,121],"an":[45],"informal":[46],"statement":[47],"our":[49],"result:":[50],"assuming":[51],"Unique":[53,130],"Games":[54,131],"Conjecture,":[55],"it":[56],"NP-hard":[58],"distinguish":[60],"whether":[61],"there":[62],"non-trivial":[65,77],"that":[67],"1\u2212":[69],"\u03b4":[70],"fraction":[71,84],"or":[75],"every":[76],"fails":[79],"satisfy":[81],"constant":[83],"with":[88],"\u201cmargin\u201d":[90],"\u03a9(":[92],"\u221a":[93],"\u03b4).":[94],"We":[95],"develop":[96],"linearity":[97],"and":[98],"dictatorship":[99],"testing":[100],"procedures":[101],"for":[102],"functions":[103],"f":[104],":":[105],"R":[106,108],"7\u2192":[107],"Gaussian":[111],"space,":[112],"which":[113],"could":[114],"independent":[117],"interest.":[118],"Our":[119],"research":[120],"motivated":[122],"by":[123],"possible":[125],"approach":[126],"proving":[128],"Conjecture.":[132]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-06-24T00:00:00"}