{"id":"https://openalex.org/W2025911494","doi":"https://doi.org/10.1145/1577190.1577212","title":"Optimization and NP_R-completeness of certain fewnomials","display_name":"Optimization and NP_R-completeness of certain fewnomials","publication_year":2009,"publication_date":"2009-08-03","ids":{"openalex":"https://openalex.org/W2025911494","doi":"https://doi.org/10.1145/1577190.1577212","mag":"2025911494"},"language":"en","primary_location":{"id":"doi:10.1145/1577190.1577212","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1577190.1577212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 conference on Symbolic numeric computation","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/A5090559121","display_name":"Philippe P\u00e9ba\u00ff","orcid":"https://orcid.org/0000-0002-2311-3775"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Philippe P. P\u00e9bay","raw_affiliation_strings":["Sandia National Laborotories, Livermore, CA, USA","Sandia National Laborotories, Livermore, CA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Sandia National Laborotories, Livermore, CA, USA","institution_ids":["https://openalex.org/I192454743"]},{"raw_affiliation_string":"Sandia National Laborotories, Livermore, CA, USA#TAB#","institution_ids":["https://openalex.org/I192454743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005847878","display_name":"J. Maurice Rojas","orcid":"https://orcid.org/0000-0002-1657-2674"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Maurice Rojas","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000430651","display_name":"David Thompson","orcid":"https://orcid.org/0000-0002-8575-6469"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David C. Thompson","raw_affiliation_strings":["Sandia National Laboratories, Livermore, CA, USA"],"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Livermore, CA, USA","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090559121"],"corresponding_institution_ids":["https://openalex.org/I192454743"],"apc_list":null,"apc_paid":null,"fwci":0.3538,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.60844381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9997000098228455,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9983000159263611,"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/mathematics","display_name":"Mathematics","score":0.7814281582832336},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.7401376962661743},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7254018783569336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5925019979476929},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5787341594696045},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5652446150779724},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5612255930900574},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5360387563705444},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5176268219947815},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49214261770248413},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4560607969760895},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4250373840332031},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11283117532730103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09222599864006042}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7814281582832336},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.7401376962661743},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7254018783569336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5925019979476929},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5787341594696045},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5652446150779724},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5612255930900574},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5360387563705444},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5176268219947815},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49214261770248413},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4560607969760895},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4250373840332031},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11283117532730103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09222599864006042},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1577190.1577212","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1577190.1577212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 conference on Symbolic numeric computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306550","display_name":"Wenner-Gren Foundation","ror":"https://ror.org/04qvvhf62"},{"id":"https://openalex.org/F4320325669","display_name":"Stockholms Universitet","ror":"https://ror.org/05f0yaq80"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W75100087","https://openalex.org/W1521877949","https://openalex.org/W1540295818","https://openalex.org/W1550331971","https://openalex.org/W1602440701","https://openalex.org/W1967184028","https://openalex.org/W1975288982","https://openalex.org/W1977375620","https://openalex.org/W1977415556","https://openalex.org/W1991832118","https://openalex.org/W2031859062","https://openalex.org/W2040721698","https://openalex.org/W2059969305","https://openalex.org/W2060589377","https://openalex.org/W2064915245","https://openalex.org/W2065276731","https://openalex.org/W2067754486","https://openalex.org/W2071550336","https://openalex.org/W2071846104","https://openalex.org/W2072221429","https://openalex.org/W2080881761","https://openalex.org/W2085045434","https://openalex.org/W2092920739","https://openalex.org/W2100793163","https://openalex.org/W2108397696","https://openalex.org/W2113097540","https://openalex.org/W2123100908","https://openalex.org/W2137560895","https://openalex.org/W2140948062","https://openalex.org/W2144770505","https://openalex.org/W2148442298","https://openalex.org/W2155376493","https://openalex.org/W2166717942","https://openalex.org/W2321772449","https://openalex.org/W2486715098","https://openalex.org/W2963231539","https://openalex.org/W4255213956","https://openalex.org/W4301168154"],"related_works":["https://openalex.org/W2953175190","https://openalex.org/W4288318511","https://openalex.org/W2257286100","https://openalex.org/W2099602951","https://openalex.org/W2784344684","https://openalex.org/W2951716561","https://openalex.org/W2093726042","https://openalex.org/W4293497044","https://openalex.org/W4389457771","https://openalex.org/W2042172774"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,17,46],"high":[3],"precision":[4],"polynomial-time":[5],"approximation":[6],"scheme":[7],"for":[8,82],"the":[9,43,51,59,68,79,86,91],"supremum":[10],"of":[11,45,54,61,93],"any":[12],"honest":[13],"n-variate":[14],"(n+2)-nomial":[15],"with":[16],"constant":[18],"term,":[19],"allowing":[20],"real":[21,26,96],"exponents":[22,97],"as":[23,25],"well":[24],"coefficients.":[27],"Our":[28],"complexity":[29,74],"bounds":[30,75],"count":[31],"field":[32],"operations":[33],"and":[34,37,42,98,101,104],"inequality":[35],"checks,":[36],"are":[38],"polynomial":[39],"in":[40,67,78],"n":[41,83],"logarithm":[44],"certain":[47],"condition":[48,63],"number.":[49],"For":[50],"special":[52],"case":[53],"polynomials":[55],"(i.e.,":[56],"integer":[57],"exponents),":[58],"log":[60],"our":[62],"number":[64],"is":[65],"sub-quadratic":[66],"sparse":[69],"size.":[70],"The":[71],"best":[72],"previous":[73],"were":[76],"exponential":[77,99],"size,":[80],"even":[81],"fixed.":[84],"Along":[85],"way,":[87],"we":[88],"partially":[89],"extend":[90],"theory":[92],"A-discriminants":[94],"to":[95],"sums,":[100],"find":[102],"new":[103],"natural":[105],"NPR-complete":[106],"problems.":[107]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}