{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:09:52Z","timestamp":1776888592218,"version":"3.51.2"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1988,2,1]],"date-time":"1988-02-01T00:00:00Z","timestamp":570672000000},"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":9298,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1988,2]]},"DOI":"10.1016\/s0747-7171(88)80003-8","type":"journal-article","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T19:34:27Z","timestamp":1207942467000},"page":"3-27","source":"Crossref","is-referenced-by-count":177,"title":["The complexity of linear problems in fields"],"prefix":"10.1016","volume":"5","author":[{"given":"Volker","family":"Weispfenning","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(88)80003-8_bib1","first-page":"457","article-title":"The complexity of elementary algebra and geometry","author":"Ben-Or","year":"1986","journal-title":"ACM Symp. on Computing"},{"key":"10.1016\/S0747-7171(88)80003-8_bib2","series-title":"Proc. 18 IEEE Symp. FOCS","first-page":"95","article-title":"Precise bounds for Presburger arithmetic and the reals with addition (preliminary report)","author":"Berman","year":"1977"},{"key":"10.1016\/S0747-7171(88)80003-8_bib3","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":"Theor. Comp. Sci"},{"key":"10.1016\/S0747-7171(88)80003-8_bib4","article-title":"Bounds on transfer principles for algebraically closed and complete, discretely vahted fields","volume":"204","author":"Brown","year":"1978"},{"key":"10.1016\/S0747-7171(88)80003-8_bib5","series-title":"Computer Algebra","article-title":"Quantifier elimination for real closed felds, a guide to the literature","author":"Collins","year":"1983"},{"key":"10.1016\/S0747-7171(88)80003-8_bib6","first-page":"91","article-title":"Theorem-proving in arithmetic without multiplication","volume":"7","author":"Cooper","year":"1972"},{"key":"10.1016\/S0747-7171(88)80003-8_bib7","first-page":"69","article-title":"A decision procedure for the first order theory of real addition with order","volume":"4","author":"Ferrante","year":"1975","journal-title":"SlAM J. Comp"},{"key":"10.1016\/S0747-7171(88)80003-8_bib8","article-title":"The computational complexity of logical theories","volume":"718","author":"Ferrante","year":"1979"},{"key":"10.1016\/S0747-7171(88)80003-8_bib9","first-page":"27","article-title":"Super-exponential complexity of Presburger arithmetic","volume":"7","author":"Fischer","year":"1974","journal-title":"SIAM-AMS Proc"},{"key":"10.1016\/S0747-7171(88)80003-8_bib10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90115-3","article-title":"The complexity of Presburger arithmetic with bounded quantifier alternation depth","volume":"18","author":"F\u00fcrer","year":"1982","journal-title":"Theor. Comp. Sci"},{"key":"10.1016\/S0747-7171(88)80003-8_bib11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(83)90002-6","article-title":"Definability and fast quantifier elimination in algebraically closed fields","volume":"24","author":"Heintz","year":"1983","journal-title":"Theor. Comp. Sci"},{"key":"10.1016\/S0747-7171(88)80003-8_bib12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(80)90048-1","article-title":"Complexity of Boolean algebras","volume":"10","author":"Kozen","year":"1980","journal-title":"Theor. Comp. Sci"},{"key":"10.1016\/S0747-7171(88)80003-8_bib13","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0001-8708(83)90055-5","article-title":"Elimination of quantifiers in algebraic structures","volume":"47","author":"Macintyre","year":"1983","journal-title":"Adv. Math"},{"key":"10.1016\/S0747-7171(88)80003-8_bib14","series-title":"Quantifier elimination for projectable L-groups and linear elimination for rings","author":"Point","year":"1983"},{"key":"10.1016\/S0747-7171(88)80003-8_bib15","first-page":"318","article-title":"Model theoretic methods in the theory of topological fields","volume":"299\/300","author":"Prestel","year":"1978","journal-title":"J. reine u. ang. Math."},{"key":"10.1016\/S0747-7171(88)80003-8_bib16","series-title":"Proc. 10 ACM Symp. Th. of Comp.","first-page":"320","article-title":"Presburger arithmetic with bounded quantifier alternation","author":"Reddy","year":"1978"},{"issue":"ser. B","key":"10.1016\/S0747-7171(88)80003-8_bib17","first-page":"19","article-title":"Quantifier elimination for linear formulas over ordered and valued fields","volume":"33","author":"van den Dries","year":"1981","journal-title":"Bull. Sos. Math. Belg"},{"key":"10.1016\/S0747-7171(88)80003-8_bib18","series-title":"Springer Lec. Notes Comp. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-07805-3_5","article-title":"Weitere zum Erf\u00fcllungsproblem polynomial \u00e4quivalente kombinatorische Aufgaben","volume":"43","author":"von zur Gathen","year":"1976"},{"key":"10.1016\/S0747-7171(88)80003-8_bib19","article-title":"Aspects of quantifier elimination in algebra","volume":"1103","author":"Weispfenning","year":"1984"},{"key":"10.1016\/S0747-7171(88)80003-8_bib20","first-page":"419","article-title":"Quantifier elimination and decision procedures for valued fields. Proc. Logic Coll. '83","volume":"1103","author":"Weispfenning","year":"1985","journal-title":"Aachen. Part I: Models and sets. (MOiler, G. H., Richter, M. M., eds). Sprhzger Lec. Notes Math"},{"key":"10.1016\/S0747-7171(88)80003-8_bib21","first-page":"87","article-title":"The complexity of elementary problems in archimedean ordered groups. Proc. EUROCAL '85 vol. 2","volume":"204","author":"Weispfenning","year":"1986"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717188800038?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717188800038?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T08:23:39Z","timestamp":1546158219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717188800038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,2]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1988,2]]}},"alternative-id":["S0747717188800038"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(88)80003-8","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1988,2]]}}}