{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T15:04:59Z","timestamp":1747580699459},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12130,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,5]]},"DOI":"10.1016\/0304-3975(80)90036-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"59-69","source":"Crossref","is-referenced-by-count":21,"title":["On time-space classes and their relation to the theory of real addition"],"prefix":"10.1016","volume":"11","author":[{"given":"Anna R.","family":"Bruss","sequence":"first","affiliation":[]},{"given":"Albert R.","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90036-5_BIB1","first-page":"95","article-title":"Precise bounds for Presburger Arithmetic and the reals with addition: Preliminary report","author":"Berman","year":"1977","journal-title":"Proc. 18th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(80)90036-5_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(80)90037-7","article-title":"The complexity of logical theories","volume":"11","author":"Berman","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90036-5_BIB3","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976","journal-title":"Proc. 17th Annual Symposium on Foundations of Computer Science"},{"issue":"1","key":"10.1016\/0304-3975(80)90036-5_BIB4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/0204006","article-title":"A decision procedure for the first order theory of real addition with order","volume":"4","author":"Ferrante","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(80)90036-5_BIB5","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","article-title":"The Computational Complexity of Logical Theories","author":"Ferrante","year":"1979"},{"key":"10.1016\/0304-3975(80)90036-5_BIB6","article-title":"Super-exponential complexity of Presburger Arithmetic","volume":"VII","author":"Fischer","year":"1974"},{"key":"10.1016\/0304-3975(80)90036-5_BIB7","series-title":"Logic Colloquium 76","first-page":"471","article-title":"Bounded concatenation theory as a uniform method for proving lower complexity bounds","author":"Fleischmann","year":"1977"},{"key":"10.1016\/0304-3975(80)90036-5_BIB8","series-title":"Bericht Nr. 76-09","article-title":"Complexity of decision problems","author":"Fleischmann","year":"1976"},{"issue":"4","key":"10.1016\/0304-3975(80)90036-5_BIB9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01694077","article-title":"On restricting Turing computability","volume":"5","author":"Glinert","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(80)90036-5_BIB10_1","series-title":"Formal Languages and their Relation to Automata","first-page":"137","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(80)90036-5_BIB10_2","series-title":"Formal Languages and their Relation to Automata","first-page":"149","author":"Hopcroft","year":"1969"},{"issue":"2","key":"10.1016\/0304-3975(80)90036-5_BIB11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1008328.1008329","article-title":"Big omicron and big omega and big theta","volume":"8","author":"Knuth","year":"1976","journal-title":"Sigact News"},{"key":"10.1016\/0304-3975(80)90036-5_BIB12","first-page":"89","article-title":"On parallelism in Turing machines","author":"Kozen","year":"1976","journal-title":"Proc. 17th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(80)90036-5_BIB13","article-title":"Computing in logarithmic space","author":"Lind","year":"1974","journal-title":"MIT Project MAC TM 52"},{"key":"10.1016\/0304-3975(80)90036-5_BIB14","first-page":"118","article-title":"The computational complexity of some logical theories","author":"Rackoff","year":"1975","journal-title":"MIT Project MAC TR 144"},{"issue":"1","key":"10.1016\/0304-3975(80)90036-5_BIB15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0022-0000(77)80041-X","article-title":"Techniques for separating space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(80)90036-5_BIB16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/322047.322061","article-title":"Separating nondeterministic time complexity classes","volume":"25","author":"Seiferas","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90036-5_BIB17","article-title":"The complexity of decision problems in automata theory and logic","author":"Stockmeyer","year":"1974","journal-title":"MIT Project MAC TR 133"},{"key":"10.1016\/0304-3975(80)90036-5_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Computer Sci."},{"key":"10.1016\/0304-3975(80)90036-5_BIB19","first-page":"1","article-title":"Word problems requiring exponential time: Preliminary report","author":"Stockmeyer","year":"1973","journal-title":"Proc. 5th Annual ACM Symposium on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:24:27Z","timestamp":1555111467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["0304397580900365"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90036-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}