{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:14:32Z","timestamp":1648883672597},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1990,6]]},"abstract":"<jats:p> The concept of limiting approximation, formerly introduced by Gold for recursive functions, is applied to the polynomial level of complexity in order to determine meaningful characterizations of classes of functions and sets which are not (or which are not known to be) polynomially computable. In particular, characterizations of NP, PSPACE and other classes of elementary functions are provided in terms of limiting polynomial approximation. In addition trade-offs between the space required by the approximating functions and the rate of convergence of the approximation are shown. <\/jats:p>","DOI":"10.1142\/s0129054190000096","type":"journal-article","created":{"date-parts":[[2004,11,28]],"date-time":"2004-11-28T21:14:37Z","timestamp":1101676477000},"page":"111-122","source":"Crossref","is-referenced-by-count":1,"title":["LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES"],"prefix":"10.1142","volume":"01","author":[{"given":"G.","family":"AUSIELLO","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica e Sistemistica Universit\u00e0 di Roma \u201cLa Sapienza\u201d Via Eudossiana 18 00185 Rome, Italy"}]},{"given":"M.","family":"PROTASI","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica Universit\u00e0 di Roma \u201cTor Vergata\u201d Via Orazio Raimondo 00173 Rome, Italy"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054190000096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:48:39Z","timestamp":1565117319000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054190000096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,1,25]]},"published-print":{"date-parts":[[1990,6]]}},"alternative-id":["10.1142\/S0129054190000096"],"URL":"https:\/\/doi.org\/10.1142\/s0129054190000096","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}