{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:36Z","timestamp":1759637796710,"version":"3.44.0"},"reference-count":43,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780120121144"}],"license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100006416","name":"Universidade Estadual de Campinas","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["70\/755","DCR75-09433","GJ-33171X"],"award-info":[{"award-number":["70\/755","DCR75-09433","GJ-33171X"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1976]]},"DOI":"10.1016\/s0065-2458(08)60449-0","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T00:56:15Z","timestamp":1295398575000},"page":"1-43","source":"Crossref","is-referenced-by-count":5,"title":["On the Structure of Feasible Computations"],"prefix":"10.1016","member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms.","author":"Aho","key":"10.1016\/S0065-2458(08)60449-0_bib1"},{"key":"10.1016\/S0065-2458(08)60449-0_bib2","first-page":"431","article-title":"Relativization of the P = ?NP questions","volume":"4","author":"Baker","year":"1975","journal-title":"Soc. Ind. Appl. Math. J. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(74)80008-5","article-title":"Comparing complexity classes","volume":"14","author":"Book","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0065-2458(08)60449-0_bib4","series-title":"Currents in the Theory of Computing","first-page":"35","author":"Borodin","year":"1973"},{"year":"1975","series-title":"Computational Complexity of Algebraic and Numeric Problems.","author":"Borodin","key":"10.1016\/S0065-2458(08)60449-0_bib5"},{"key":"10.1016\/S0065-2458(08)60449-0_bib6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second order arithmetic and finite automata","volume":"6","author":"B\u00fcchi","year":"1960","journal-title":"Z. Math. Logik Grundagen Math."},{"key":"10.1016\/S0065-2458(08)60449-0_bib7","article-title":"Decision problems of weak second order arithmetics and finite automata. Part I","volume":"5","author":"B\u00fcchi","year":"1959","journal-title":"Amer. Math. Soc. Notices"},{"key":"10.1016\/S0065-2458(08)60449-0_bib8","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Annu. Ass. Comput. Mach. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib9","first-page":"75","article-title":"Linear time simulation of deterministic two-way pushdown automata","volume":"71","author":"Cook","year":"1972","journal-title":"Inform. Process."},{"key":"10.1016\/S0065-2458(08)60449-0_bib10","first-page":"66","article-title":"A combinatorial problem which is complete in polynomial space","author":"Even","year":"1975","journal-title":"Proc. 7th Annu. Amer. Math. Soc. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib11","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"7","author":"Fagin","year":"1974","journal-title":"SIAM-AMS (Soc. Ind. Appl. Math.-Amer. Math. Soc.) Proc."},{"key":"10.1016\/S0065-2458(08)60449-0_bib12","first-page":"27","article-title":"Super-exponential complexity of Pressburger arithmetic","volume":"7","author":"Fischer","year":"1974","journal-title":"SIAM-AMS (Soc. Ind. Appl. Math.-Amer. Math. Soc.) Proc."},{"key":"10.1016\/S0065-2458(08)60449-0_bib13","first-page":"47","article-title":"Some simplified NP-complete problems","author":"Garey","year":"1974","journal-title":"Proc. 7th Annu. Ass. Comput. Mach. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib14","first-page":"304","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"Soc. Ind. Appl. Math. J. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib15","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","article-title":"An overview of the theory of computational complexity","volume":"18","author":"Hartmanis","year":"1971","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/S0065-2458(08)60449-0_bib16","first-page":"1","article-title":"The Iba problem and its importance in the theory of computing","volume":"7","author":"Hartmanis","year":"1974","journal-title":"SIAM-AMS (Soc. Ind. Appl. Math.-Amer. Math. Soc.) Proc."},{"key":"10.1016\/S0065-2458(08)60449-0_bib17","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/321466.321470","article-title":"On the recognition of primes by automata","volume":"15","author":"Hartmanis","year":"1968","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/S0065-2458(08)60449-0_bib18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01746518","article-title":"Two memory bounds for the recognition of primes by automata","volume":"3","author":"Hartmanis","year":"1969","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/S0065-2458(08)60449-0_bib19","first-page":"13","article-title":"On the power of multiplication in random access machines","author":"Hartmanis","year":"1974","journal-title":"IEEE Conf. Rec. 15th Symp. Switching Automata Theory 1974"},{"year":"1969","series-title":"Formal Languages and their Relation to Automata.","author":"Hopcroft","key":"10.1016\/S0065-2458(08)60449-0_bib20"},{"key":"10.1016\/S0065-2458(08)60449-0_bib21","doi-asserted-by":"crossref","unstructured":"H.B. Hunt III On time and tape complexity of languages. Ph.D. Dissertation 1973 Cornell University Ithaca, New York.","DOI":"10.1145\/800125.804030"},{"key":"10.1016\/S0065-2458(08)60449-0_bib22","first-page":"10","article-title":"On time and tape complexity of languages","author":"Hunt","year":"1973","journal-title":"Proc. 5th Annu. Ass. Comput. Math. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib23","first-page":"54","article-title":"On the complexity of grammar and related problems","author":"Hunt","year":"1975","journal-title":"Proc. 7th Annu. Ass. Comput. Math. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib24","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibilities among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0065-2458(08)60449-0_bib25","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear bounded automata","volume":"3","author":"Kuroda","year":"1964","journal-title":"Inform. Contr."},{"key":"10.1016\/S0065-2458(08)60449-0_bib26","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0019-9958(63)90169-4","article-title":"Three theorems on phrase structure grammars of type 1","volume":"2","author":"Landweber","year":"1963","journal-title":"Inform. Contr."},{"key":"10.1016\/S0065-2458(08)60449-0_bib27","series-title":"Sequential Machines: Selected Papers","first-page":"157","article-title":"Regular expressions and state graphs","author":"McNaughton","year":"1964"},{"year":"1973","series-title":"Weak Monadic Second Order Theory of Successor Is Not Elementary Recursive","author":"Meyer","key":"10.1016\/S0065-2458(08)60449-0_bib28"},{"key":"10.1016\/S0065-2458(08)60449-0_bib29","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972","journal-title":"IEEE Conf. Rec. 13th Symp. Switching Automata Theory 1972"},{"key":"10.1016\/S0065-2458(08)60449-0_bib30","first-page":"1","article-title":"Word problems requiring exponential tape","author":"Meyer","year":"1973","journal-title":"Proc. 5th Annu. Ass. Comput. Mach. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib31","series-title":"Lecture Notes in Computer Science.","article-title":"Inherent Computational Complexity of Decision Problems in Logic and Automata Theory","author":"Meyer","year":"1975"},{"key":"10.1016\/S0065-2458(08)60449-0_bib32","first-page":"234","article-title":"Riemann's hypotheses and tests of primality","author":"Miller","year":"1975","journal-title":"Proc. 7th Annu. Ass. Comput. Mach. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib33","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/321574.321575","article-title":"Form and content in computer science","volume":"17","author":"Minsky","year":"1970","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/S0065-2458(08)60449-0_bib34","first-page":"60","article-title":"Linearly bounded automata","author":"Myhill","year":"1960","journal-title":"WADD Tech. Note"},{"key":"10.1016\/S0065-2458(08)60449-0_bib35","first-page":"34","article-title":"Elementary bounds for Pressburger arithmetic","author":"Oppen","year":"1973","journal-title":"Proc. 5th Annu. Ass. Comput. Mach. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib36","first-page":"122","article-title":"A characterization of the power of vector machines","author":"Pratt","year":"1974","journal-title":"Proc. 6th Annu. Ass. Comput. Mach. Symp. Theor. Comput."},{"key":"10.1016\/S0065-2458(08)60449-0_bib37","first-page":"92","article-title":"\u00dcber die Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt","author":"Pressburger","year":"1930","journal-title":"C.R. Congr. Math. Pays Slavs, 1st 1930"},{"key":"10.1016\/S0065-2458(08)60449-0_bib38","first-page":"24","article-title":"The equivalence problem for regular expressions over one letter alphabet is elementary","author":"Rangel","year":"1974","journal-title":"IEEE Conf. Rec. 15th Symp. Switching Automata Theory 1974"},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability.","author":"Rogers","key":"10.1016\/S0065-2458(08)60449-0_bib39"},{"key":"10.1016\/S0065-2458(08)60449-0_bib40","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relations between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0065-2458(08)60449-0_bib41","series-title":"On the Power of Multiplication in Random Access Machines","first-page":"74","author":"Simon","year":"1974"},{"key":"10.1016\/S0065-2458(08)60449-0_bib42","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965","journal-title":"IEEE Conf. Rec. 6th Symp. Switching Automata Theory 1965"},{"year":"1974","series-title":"The Complexity of Decision Problems in Automata Theory and Logic, Proj. MAC TR 133.","author":"Stockmeyer","key":"10.1016\/S0065-2458(08)60449-0_bib43"}],"container-title":["Advances in Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0065245808604490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0065245808604490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T19:40:02Z","timestamp":1758742802000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0065245808604490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"ISBN":["9780120121144"],"references-count":43,"URL":"https:\/\/doi.org\/10.1016\/s0065-2458(08)60449-0","relation":{},"ISSN":["0065-2458"],"issn-type":[{"type":"print","value":"0065-2458"}],"subject":[],"published":{"date-parts":[[1976]]}}}