{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:47:28Z","timestamp":1724615248588},"reference-count":0,"publisher":"American Mathematical Society (AMS)","issue":"266","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"published-print":{"date-parts":[[2008,11,17]]},"DOI":"10.1090\/s0025-5718-08-02200-x","type":"journal-article","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T13:09:23Z","timestamp":1259672963000},"page":"1089-1107","source":"Crossref","is-referenced-by-count":29,"title":["The complexity of class polynomial computation via floating point approximations"],"prefix":"10.1090","volume":"78","author":[{"given":"Andreas","family":"Enge","sequence":"first","affiliation":[]}],"member":"14","container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2009-78-266\/S0025-5718-08-02200-X\/S0025-5718-08-02200-X.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T13:57:46Z","timestamp":1546264666000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.ams.org\/journal-getitem?pii=S0025-5718-08-02200-X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,17]]},"references-count":0,"journal-issue":{"issue":"266","published-print":{"date-parts":[[2009,4,1]]}},"alternative-id":["S002557180802200X"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-08-02200-x","relation":{},"ISSN":["0025-5718"],"issn-type":[{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2008,11,17]]}}}