{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:11:18Z","timestamp":1776755478180,"version":"3.51.2"},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1016\/0196-6774(81)90036-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"385-392","source":"Crossref","is-referenced-by-count":11,"title":["Irreducible polynomials with integral coefficients have succinct certificates"],"prefix":"10.1016","volume":"2","author":[{"given":"David G","family":"Cantor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(81)90036-5_BIB1","series-title":"Computers and Intractibility\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(81)90036-5_BIB2","volume":"Vol. 1","author":"Henrici","year":"1974"},{"key":"10.1016\/0196-6774(81)90036-5_BIB3","volume":"Vol. 2","author":"Knuth","year":"1980"},{"key":"10.1016\/0196-6774(81)90036-5_BIB4","series-title":"Proceedings, 20th IEEE Symposium on Foundations of Computer Science","first-page":"47","article-title":"Succinct certificates for the solvability of binary quadratic Diophantine equations","author":"Lagarias","year":"1979"},{"key":"10.1016\/0196-6774(81)90036-5_BIB5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Riemann's hypothesis and tests for primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comp. System Sci."},{"key":"10.1016\/0196-6774(81)90036-5_BIB6","series-title":"Proceedings, 18th IEEE Symposium on Foundations of Computer Science","first-page":"241","article-title":"New NP-hard and NP-complete polynomial and integer divisibility problems","author":"Plaisted","year":"1977"},{"key":"10.1016\/0196-6774(81)90036-5_BIB7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(81)90036-5_BIB8","unstructured":"P. J. Weinberger, Finding the number of factors of a polynomial, to be published."},{"key":"10.1016\/0196-6774(81)90036-5_BIB9","series-title":"Lehrbuch der Algebra I","author":"Weber","year":"1979"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:18Z","timestamp":1548744738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677481900365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["0196677481900365"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(81)90036-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}