{"id":"https://openalex.org/W2789391231","doi":"https://doi.org/10.1145/3321479","title":"A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations","display_name":"A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations","publication_year":2019,"publication_date":"2019-05-31","ids":{"openalex":"https://openalex.org/W2789391231","doi":"https://doi.org/10.1145/3321479","mag":"2789391231"},"language":"en","primary_location":{"id":"doi:10.1145/3321479","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321479","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1803.03600","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gregorio Malajovich","orcid":"https://orcid.org/0000-0001-8456-3959"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Gregorio Malajovich","raw_affiliation_strings":["Universidade Federal do Rio de Janeiro, Rio de Janeiro RJ, Brazil"],"raw_orcid":"https://orcid.org/0000-0001-8456-3959","affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio de Janeiro, Rio de Janeiro RJ, Brazil","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mike Shub","orcid":null},"institutions":[{"id":"https://openalex.org/I125687163","display_name":"City College of New York","ror":"https://ror.org/00wmhkr98","country_code":"US","type":"education","lineage":["https://openalex.org/I125687163"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mike Shub","raw_affiliation_strings":["The City College of the City University of New York, New York, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The City College of the City University of New York, New York, USA","institution_ids":["https://openalex.org/I125687163"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1776,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.47953026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"66","issue":"4","first_page":"1","last_page":"38"},"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.6302000284194946,"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.6302000284194946,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.1145000010728836,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.07450000196695328,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7533000111579895},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6331999897956848},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45649999380111694},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44699999690055847},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.43369999527931213},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42410001158714294},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.40860000252723694},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.3799999952316284}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7533000111579895},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6331999897956848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6215000152587891},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45649999380111694},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44699999690055847},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.43369999527931213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42640000581741333},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42410001158714294},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.40860000252723694},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.3799999952316284},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.3792000114917755},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3208000063896179},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3037000000476837},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.2777000069618225},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2718999981880188},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.2615000009536743},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.2605000138282776}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3321479","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321479","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1803.03600","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.03600","pdf_url":"https://arxiv.org/pdf/1803.03600","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":"pmh:oai:arXiv.org:1803.03600","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.03600","pdf_url":"https://arxiv.org/pdf/1803.03600","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"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1636577564","https://openalex.org/W1991813962","https://openalex.org/W1999414080","https://openalex.org/W2071846104","https://openalex.org/W2079400692","https://openalex.org/W2092920739","https://openalex.org/W2166717942","https://openalex.org/W2482799402","https://openalex.org/W2963573218"],"related_works":[],"abstract_inverted_index":{"We":[0,9,47,111],"develop":[1,74],"a":[2,12,26,75],"complexity":[3],"theory":[4,13,38,56,68,76,84,121],"for":[5,14],"approximate":[6,81],"real":[7],"computations.":[8,82],"first":[10],"produce":[11],"exact":[15],"computations":[16,91],"but":[17],"with":[18,77],"condition":[19,27],"numbers.":[20],"The":[21,37],"input":[22],"size":[23],"depends":[24],"on":[25],"number,":[28],"which":[29],"is":[30,51,62,85],"not":[31,52,63],"assumed":[32],"known":[33],"by":[34],"the":[35,66,70,113,123],"machine.":[36],"admits":[39,101],"deterministic":[40],"and":[41,58,79,104,106],"nondeterministic":[42],"polynomial":[43],"time":[44],"recognizable":[45],"problems.":[46],"prove":[48],"that":[49,92],"P":[50,61,103,114,125],"NP":[53,64,105,116,127],"in":[54,65,96,118],"this":[55,119],"if":[57,60],"only":[59],"BSS":[67],"over":[69],"reals.":[71],"Then":[72],"we":[73],"weak":[78],"strong":[80],"This":[83],"intended":[86],"to":[87,122],"model":[88],"actual":[89],"numerical":[90],"are":[93],"usually":[94],"performed":[95],"floating":[97],"point":[98],"arithmetic.":[99],"It":[100],"classes":[102],"also":[107],"an":[108],"NP-complete":[109],"problem.":[110,128],"relate":[112],"vs.":[115,126],"question":[117],"new":[120],"classical":[124]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2018-03-29T00:00:00"}