{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:18:14Z","timestamp":1774991894212,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90130-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"125-138","source":"Crossref","is-referenced-by-count":46,"title":["New NP-hard and NP-complete polynomial and integer divisibility problems"],"prefix":"10.1016","volume":"31","author":[{"given":"David A.","family":"Plaisted","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90130-0_BIB1","first-page":"151","article-title":"Reducibility, randomness, and intractability","author":"Adleman","year":"1977","journal-title":"9th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(84)90130-0_BIB2","first-page":"397","article-title":"Reductions that lie","author":"Adleman","year":"1979","journal-title":"Proc. 20th Annual Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(84)90130-0_BIB3","first-page":"387","article-title":"A Survey of Modern Algebra","author":"Birkhoff","year":"1965"},{"key":"10.1016\/0304-3975(84)90130-0_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(84)90130-0_BIB5","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(84)90130-0_BIB6","series-title":"Algebraic Number Fields, L-functions, and Galots Properties","first-page":"409","article-title":"Effective versions of the Chebotarev Density Theorem","author":"Lagarias","year":"1977"},{"key":"10.1016\/0304-3975(84)90130-0_BIB7","first-page":"47","article-title":"Succinct certificates for the solvability of binary quadratic Diophantine equations","author":"Lagarias","year":"1979","journal-title":"Proc. 20th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(84)90130-0_BIB8","first-page":"206","article-title":"Algebra","author":"Lang","year":"1970"},{"key":"10.1016\/0304-3975(84)90130-0_BIB9","series-title":"Topics in Number Theory Vol. II","first-page":"201","author":"Leveque","year":"1956"},{"issue":"56","key":"10.1016\/0304-3975(84)90130-0_BIB10_1","first-page":"137","article-title":"On the least prime in an arithmetic progression, I","volume":"15","author":"Linnik","year":"1944","journal-title":"Mat. Sb. (N.S.)"},{"issue":"57","key":"10.1016\/0304-3975(84)90130-0_BIB10_2","first-page":"347","article-title":"On the least prime in an arithmetic progression, II","volume":"15","author":"Linnik","year":"1944","journal-title":"Mat. Sb. (N.S.)"},{"key":"10.1016\/0304-3975(84)90130-0_BIB11","first-page":"23","article-title":"NP-complete decision problems for quadratic polynomials","author":"Manders","year":"1976","journal-title":"Proc. 8th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(84)90130-0_BIB12","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1137\/0207036","article-title":"Some polynomial and integer divisibility problems are NP-hard","volume":"7","author":"Plaisted","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(84)90130-0_BIB13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/S0022-0000(77)80013-5","article-title":"Sparse complex polynomials and polynomial reducibility","volume":"14","author":"Plaisted","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90130-0_BIB14","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:02Z","timestamp":1555127462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584901300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584901300"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90130-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}