{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:45:32Z","timestamp":1760078732077},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":4095,"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":[[2002,5]]},"DOI":"10.1016\/s0304-3975(00)00425-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:26:31Z","timestamp":1027639591000},"page":"29-49","source":"Crossref","is-referenced-by-count":4,"title":["Residue polynomial systems"],"prefix":"10.1016","volume":"279","author":[{"given":"Peter R.","family":"Turner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00425-4_BIB1","first-page":"565","article-title":"Sylvester's identity and multistep integer-preserving Gaussian elimination","volume":"22","author":"Bareiss","year":"1968","journal-title":"Math. Comput."},{"year":"1992","series-title":"Numerical Methods and Analysis","author":"Buchanan","key":"10.1016\/S0304-3975(00)00425-4_BIB2"},{"year":"1992","series-title":"Algorithms for Computer Algebra","author":"Geddes","key":"10.1016\/S0304-3975(00)00425-4_BIB3"},{"year":"1981","series-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"Knuth","key":"10.1016\/S0304-3975(00)00425-4_BIB4"},{"key":"10.1016\/S0304-3975(00)00425-4_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/271130.271133","article-title":"Fraction-free algorithms for linear and polynomial equations","volume":"31","author":"Nakos","year":"1997","journal-title":"ACM SIGSAM Bull."},{"key":"10.1016\/S0304-3975(00)00425-4_BIB6","doi-asserted-by":"crossref","unstructured":"P.R. Turner, Fraction-free RNS algorithms for solving linear systems, Proc. ARITH13, IEEE Computer Society, Washington DC, July 1997, pp. 218\u2013224.","DOI":"10.1109\/ARITH.1997.614898"},{"key":"10.1016\/S0304-3975(00)00425-4_BIB7","unstructured":"P.R. Turner, Residue polynomial systems, NAWCAD Patuxent River, Tech. Rep., 1997."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004254?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004254?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T09:51:22Z","timestamp":1555149082000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0304397500004254"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00425-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}