{"id":"https://openalex.org/W1964186004","doi":"https://doi.org/10.1137/0215027","title":"Optimal Approximations and Polynomially Levelable Sets","display_name":"Optimal Approximations and Polynomially Levelable Sets","publication_year":1986,"publication_date":"1986-05-01","ids":{"openalex":"https://openalex.org/W1964186004","doi":"https://doi.org/10.1137/0215027","mag":"1964186004"},"language":"en","primary_location":{"id":"doi:10.1137/0215027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215027","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5058753686","display_name":"Pekka Orponen","orcid":"https://orcid.org/0000-0002-0417-2104"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pekka Orponen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111448412","display_name":"David A. Russo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David A. Russo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055009733","display_name":"Uwe Sch\u00f6ning","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uwe Sch\u00f6ning","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058753686"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.745,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95084624,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"399","last_page":"408"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9975000023841858,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9975000023841858,"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.9962999820709229,"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.9922999739646912,"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.6902111172676086},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6612372398376465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5874069929122925},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5710462927818298},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5597518682479858},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.52424556016922},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5223047137260437},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5037209391593933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4824693500995636},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.42610472440719604},{"id":"https://openalex.org/keywords/approximations-of-\u03c0","display_name":"Approximations of \u03c0","score":0.4100552201271057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.265860915184021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16717484593391418},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.1434224545955658}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6902111172676086},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6612372398376465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5874069929122925},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5710462927818298},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5597518682479858},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.52424556016922},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5223047137260437},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5037209391593933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4824693500995636},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.42610472440719604},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.4100552201271057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.265860915184021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16717484593391418},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.1434224545955658},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215027","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W214738142","https://openalex.org/W1518206649","https://openalex.org/W1975592766","https://openalex.org/W1981282181","https://openalex.org/W1986448430","https://openalex.org/W2069139349","https://openalex.org/W2069890413","https://openalex.org/W2087899564","https://openalex.org/W2090186532","https://openalex.org/W2095229434","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W4390579151","https://openalex.org/W2113270940","https://openalex.org/W4252842032","https://openalex.org/W2900627138"],"abstract_inverted_index":{"A":[0,2,13,30,43,81],"set":[1],"not":[3,115],"in":[4,21,51,59,116],"P":[5,117],"is":[6,35,83],"polynomially":[7,108],"levelable":[8],"if":[9,24],"any":[10,26],"algorithm":[11,27,40],"for":[12,29,42,113,125],"has":[14],"speedup":[15],"to":[16,37,80],"a":[17,93,126,138],"polynomial":[18,32,45,76],"infinitely":[19,55],"often":[20],"A:":[22],"precisely,":[23],"given":[25],"M":[28,67],"and":[31,44,136],"p,":[33],"it":[34],"possible":[36],"find":[38],"another":[39],"$M'$":[41,49],"$p'$,":[46],"such":[47],"that":[48,74,101,118],"runs":[50],"time":[52,65,77,128],"$p'(|x|)$":[53],"on":[54,61,92],"many":[56],"inputs":[57],"x":[58],"A,":[60],"which":[62],"the":[63],"running":[64],"of":[66,97,142],"exceeds":[68],"$p(|x|)$.":[69],"Intuitively,":[70],"this":[71,112],"condition":[72],"states":[73],"among":[75],"computable":[78],"approximations":[79],"there":[82],"no":[84],"optimal":[85],"one,":[86],"or":[87,123],"one":[88],"giving":[89],"correct":[90],"answers":[91],"maximally":[94],"large":[95],"subset":[96],"A.":[98],"It":[99],"appears":[100],"most":[102],"naturally":[103],"occurring":[104],"intractable":[105],"sets":[106,114],"are":[107,119],"levelable.":[109],"We":[110,130],"prove":[111],"either":[120],"\u201cpaddable,\u201d":[121],"\u201cself-reducible,\u201d":[122],"complete":[124],"deterministic":[127],"class.":[129],"also":[131],"discuss":[132],"levelability":[133],"preserving":[134],"reductions,":[135],"give":[137],"simple":[139],"reducibility":[140],"characterization":[141],"nonlevelable":[143],"sets.":[144]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}