{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:20:27Z","timestamp":1773224427139,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":6255,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0012-365x(95)00135-j","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"177-188","source":"Crossref","is-referenced-by-count":13,"title":["Lattice basis reduction for indefinite forms and an application"],"prefix":"10.1016","volume":"153","author":[{"given":"G\u00e1bor","family":"Ivanyos","sequence":"first","affiliation":[]},{"given":"\u00c1gnes","family":"Sz\u00e1nt\u00f3","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00135-J_BIB1","article-title":"Rational Quadratic Forms","author":"Cassels","year":"1978"},{"key":"10.1016\/0012-365X(95)00135-J_BIB2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","article-title":"Improved methods for calculating vectors of short length in a lattice, including a complexity analysis","volume":"44","author":"Fincke","year":"1985","journal-title":"Math. Comp."},{"key":"10.1016\/0012-365X(95)00135-J_BIB3","series-title":"Proc. FCT '76","first-page":"386","article-title":"Polynomial time algorithms in the theory of linear diophantine equations","volume":"vol. 56","author":"Frumkin","year":"1976"},{"key":"10.1016\/0012-365X(95)00135-J_BIB4","series-title":"Proc. 17th ACM STOC","first-page":"153","article-title":"Polynomial time solution of some problems in computational algebra","author":"Friedl","year":"1985"},{"key":"10.1016\/0012-365X(95)00135-J_BIB5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01271370","article-title":"Finding maximal orders in semisimple algebras over","volume":"3","author":"Ivanyos","year":"1993","journal-title":"Q, Comput. Complexity"},{"key":"10.1016\/0012-365X(95)00135-J_BIB6","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(95)00135-J_BIB7","article-title":"An algorithmic theory of numbers, graphs and convexity","author":"Lov\u00e1sz","year":"1985","journal-title":"Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn Report"},{"key":"10.1016\/0012-365X(95)00135-J_BIB8","series-title":"Associative Algebras","author":"Pierce","year":"1982"},{"key":"10.1016\/0012-365X(95)00135-J_BIB9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0747-7171(87)80061-5","article-title":"A modification of the LLL reduction algorithm","volume":"4","author":"Pohst","year":"1987","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/0012-365X(95)00135-J_BIB10","series-title":"Maximal Orders","author":"Reiner","year":"1975"},{"key":"10.1016\/0012-365X(95)00135-J_BIB11","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/0196-6774(88)90014-4","article-title":"Zero divisors in quaternion algebras","volume":"9","author":"R\u00f3nyai","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(95)00135-J_BIB12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01272075","article-title":"Algorithmic properties of maximal orders in simple algebras over Q","volume":"2","author":"R\u00f3nyai","year":"1992","journal-title":"Comput. Complexity"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500135J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500135J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:24:03Z","timestamp":1556130243000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500135J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0012365X9500135J"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00135-j","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}