{"id":"https://openalex.org/W2019886197","doi":"https://doi.org/10.1007/bf01585569","title":"The complexity of approximating a nonlinear program","display_name":"The complexity of approximating a nonlinear program","publication_year":1995,"publication_date":"1995-07-01","ids":{"openalex":"https://openalex.org/W2019886197","doi":"https://doi.org/10.1007/bf01585569","mag":"2019886197"},"language":"en","primary_location":{"id":"doi:10.1007/bf01585569","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585569","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-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/A5033480276","display_name":"Mihir Bellare","orcid":"https://orcid.org/0000-0002-8765-5573"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mihir Bellare","raw_affiliation_strings":["Advanced Networking Laboratory, IBM T.J. Watson Research Center, P.O. Box 704, 10598, Yorktown Heights, NY, USA","Advanced Networking Laboratory, IBM T.J. Watson Research Center, Yorktown Heights, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Advanced Networking Laboratory, IBM T.J. Watson Research Center, P.O. Box 704, 10598, Yorktown Heights, NY, USA","institution_ids":[]},{"raw_affiliation_string":"Advanced Networking Laboratory, IBM T.J. Watson Research Center, Yorktown Heights, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007040282","display_name":"Phillip Rogaway","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Phillip Rogaway","raw_affiliation_strings":["Department of Computer Science, University of California at Davis, 95616, Davis, CA, USA","Department of Computer Science, University of California at Davis, Davis, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California at Davis, 95616, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Computer Science, University of California at Davis, Davis, USA#TAB#","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":9.4894,"has_fulltext":false,"cited_by_count":130,"citation_normalized_percentile":{"value":0.9867511,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"69","issue":"1-3","first_page":"429","last_page":"441"},"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.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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.7910541296005249},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6430563926696777},{"id":"https://openalex.org/keywords/stable-polynomial","display_name":"Stable polynomial","score":0.5637579560279846},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5451008081436157},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49857211112976074},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.45456627011299133},{"id":"https://openalex.org/keywords/matrix-polynomial","display_name":"Matrix polynomial","score":0.45443621277809143},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4410216808319092},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4215141534805298},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4147673547267914},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4062296748161316},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.39080071449279785},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3763137459754944},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33551710844039917},{"id":"https://openalex.org/keywords/square-free-polynomial","display_name":"Square-free polynomial","score":0.2183697521686554},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11525189876556396}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7910541296005249},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6430563926696777},{"id":"https://openalex.org/C45025165","wikidata":"https://www.wikidata.org/wiki/Q13424738","display_name":"Stable polynomial","level":5,"score":0.5637579560279846},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5451008081436157},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49857211112976074},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.45456627011299133},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.45443621277809143},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4410216808319092},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4215141534805298},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4147673547267914},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4062296748161316},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39080071449279785},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3763137459754944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33551710844039917},{"id":"https://openalex.org/C101525915","wikidata":"https://www.wikidata.org/wiki/Q7581979","display_name":"Square-free polynomial","level":4,"score":0.2183697521686554},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11525189876556396},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf01585569","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585569","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.7685","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.7685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucdavis.edu/~rogaway/papers/qp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cse.ucsd.edu/users/mihir/papers/qp.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"No poverty","id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320310400","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W569270505","https://openalex.org/W1511716344","https://openalex.org/W1573405943","https://openalex.org/W1589953248","https://openalex.org/W1970606468","https://openalex.org/W1975218943","https://openalex.org/W1984818365","https://openalex.org/W1991006936","https://openalex.org/W1993200481","https://openalex.org/W1995246641","https://openalex.org/W2016232593","https://openalex.org/W2018556306","https://openalex.org/W2027470314","https://openalex.org/W2055767422","https://openalex.org/W2067754486","https://openalex.org/W2079473728","https://openalex.org/W2080578129","https://openalex.org/W2090863037","https://openalex.org/W2096390054","https://openalex.org/W2097206148","https://openalex.org/W2119397119","https://openalex.org/W2132605415","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2144675047","https://openalex.org/W2148957455","https://openalex.org/W2152128484","https://openalex.org/W2152221184","https://openalex.org/W2156867528","https://openalex.org/W2163710432","https://openalex.org/W2486948290","https://openalex.org/W2561675875","https://openalex.org/W2622192510","https://openalex.org/W4235178139","https://openalex.org/W4241764762","https://openalex.org/W4256317935","https://openalex.org/W6655503447"],"related_works":["https://openalex.org/W1543706171","https://openalex.org/W2023818677","https://openalex.org/W2047844713","https://openalex.org/W2084988136","https://openalex.org/W2379712779","https://openalex.org/W1489986405","https://openalex.org/W148891984","https://openalex.org/W1964170686","https://openalex.org/W2135696506","https://openalex.org/W2099412787"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}