{"id":"https://openalex.org/W1970585244","doi":"https://doi.org/10.1142/s0129054190000096","title":"LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES","display_name":"LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W1970585244","doi":"https://doi.org/10.1142/s0129054190000096","mag":"1970585244"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054190000096","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054190000096","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5102716483","display_name":"Giorgio Ausiello","orcid":"https://orcid.org/0000-0003-1345-5007"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"G. AUSIELLO","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica Universit\u00e0 di Roma \u201cLa Sapienza\u201d Via Eudossiana 18 00185 Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica Universit\u00e0 di Roma \u201cLa Sapienza\u201d Via Eudossiana 18 00185 Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112193012","display_name":"Marco Protasi","orcid":null},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. PROTASI","raw_affiliation_strings":["Dipartimento di Matematica Universit\u00e0 di Roma \u201cTor Vergata\u201d Via Orazio Raimondo 00173 Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Universit\u00e0 di Roma \u201cTor Vergata\u201d Via Orazio Raimondo 00173 Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102716483"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.4806,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5691837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"01","issue":"02","first_page":"111","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9710999727249146,"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.9710999727249146,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9193000197410583,"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.7098888158798218},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.6410032510757446},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6017825603485107},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5887330174446106},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5478281378746033},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5083958506584167},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4594690501689911},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44946178793907166},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.42043226957321167},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4116840362548828},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.39790117740631104},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.38963136076927185},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.36069244146347046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16827961802482605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16167420148849487},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10809603333473206}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7098888158798218},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.6410032510757446},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6017825603485107},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5887330174446106},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5478281378746033},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5083958506584167},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4594690501689911},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44946178793907166},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.42043226957321167},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4116840362548828},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.39790117740631104},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38963136076927185},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.36069244146347046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16827961802482605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16167420148849487},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10809603333473206},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054190000096","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054190000096","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/14253","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/14253","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2085484366","https://openalex.org/W2591371812","https://openalex.org/W1981914472","https://openalex.org/W1504200807","https://openalex.org/W2327776271","https://openalex.org/W2161147766","https://openalex.org/W1589381382","https://openalex.org/W2082636129","https://openalex.org/W2075449032","https://openalex.org/W1676587966"],"abstract_inverted_index":{"The":[0],"concept":[1],"of":[2,18,26,28,47,53,60,78,80],"limiting":[3,61],"approximation,":[4],"formerly":[5],"introduced":[6],"by":[7,71],"Gold":[8],"for":[9],"recursive":[10],"functions,":[11],"is":[12],"applied":[13],"to":[14,22,40],"the":[15,68,72,76,81],"polynomial":[16,62],"level":[17],"complexity":[19],"in":[20,58],"order":[21],"determine":[23],"meaningful":[24],"characterizations":[25,46],"classes":[27,52],"functions":[29,55,74],"and":[30,50,75],"sets":[31],"which":[32,36],"are":[33,37,56,83],"not":[34,38],"(or":[35],"known":[39],"be)":[41],"polynomially":[42],"computable.":[43],"In":[44,64],"particular,":[45],"NP,":[48],"PSPACE":[49],"other":[51],"elementary":[54],"provided":[57],"terms":[59],"approximation.":[63],"addition":[65],"trade-offs":[66],"between":[67],"space":[69],"required":[70],"approximating":[73],"rate":[77],"convergence":[79],"approximation":[82],"shown.":[84]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}