{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T15:21:42Z","timestamp":1777994502129,"version":"3.51.4"},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540508406","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029002","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:28:19Z","timestamp":1133414899000},"page":"400-406","source":"Crossref","is-referenced-by-count":14,"title":["Membership in polynomial ideals over Q is exponential space complete"],"prefix":"10.1007","author":[{"given":"Ernst","family":"Mayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","volume":"5","author":"L. Csanky","year":"1976","unstructured":"L. Csanky: Fast Parallel Matrix Inversion Algorithms. SIAM J. Comput.\n5 (1976), 618\u2013623.","journal-title":"SIAM J. Comput."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie: Parallelism in Random Access Machines. Proceedings of the 10th Ann. ACM STOC (1978), 114\u2013118.","DOI":"10.1145\/800133.804339"},{"key":"34_CR3","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1007\/BF01206635","volume":"95","author":"G. Hermann","year":"1926","unstructured":"G. Hermann: Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann.\n95 (1926), 736\u2013788.","journal-title":"Math. Ann."},{"key":"34_CR4","unstructured":"Huynh, Dung T.: The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals. Preprint, Computer Science Department, Iowa State University (1984)."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(80)90042-3","volume":"11","author":"O.H. Ibarra","year":"1980","unstructured":"O.H. Ibarra, S. Moran, and L. E. Roiser: A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. Information Processing Letters\n11 (1980), 162.","journal-title":"Information Processing Letters"},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E.W. Mayr","year":"1982","unstructured":"E.W. Mayr and A.R. Meyer: The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals. Adv. in Math. 46 (1982), 305\u2013329.","journal-title":"Adv. in Math."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"V. Pan: Complexity of Parallel Matrix Computations. Theoretical Computer Science\n54 (1987).","DOI":"10.1016\/0304-3975(87)90019-3"},{"issue":"2","key":"34_CR8","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1090\/S0002-9939-1974-0416874-9","volume":"44","author":"F. Richman","year":"1974","unstructured":"F. Richman: Constructive Aspects of Noetherian Rings. Proc. Amer. Math. Soc.\n44, 2 (1974), 436\u2013441.","journal-title":"Proc. Amer. Math. Soc."},{"key":"34_CR9","first-page":"273","volume":"44","author":"S. A","year":"1974","unstructured":"Seidenberg, A.: Constructions in Algebra. Trans. Amer. Math. Soc.\n44 (1974), 273\u2013313.","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","STACS 89"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029002.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:32Z","timestamp":1607551172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540508406"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0029002","relation":{},"subject":[]}}