乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:42:49Z","timestamp":1720201369641},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:00:00Z","timestamp":1557446400000},"content-version":"vor","delay-in-days":1470,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1016\/j.tcs.2015.02.013","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T12:18:07Z","timestamp":1424261887000},"page":"88-99","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["A faster algorithm for testing polynomial representability of functions over finite integer rings"],"prefix":"10.1016","volume":"579","author":[{"given":"Ashwin","family":"Guha","sequence":"first","affiliation":[]},{"given":"Ambedkar","family":"Dukkipati","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2015.02.013_br0010","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-314X(92)90116-7","article-title":"Functions and polynomials over Galois rings","volume":"41","author":"Brawley","year":"1992","journal-title":"J. Number Theory"},{"issue":"1","key":"10.1016\/j.tcs.2015.02.013_br0020","doi-asserted-by":"crossref","first-page":"67","DOI":"10.4064\/aa-9-1-67-78","article-title":"Functions and polynomials (modpn)","volume":"9","author":"Carlitz","year":"1964","journal-title":"Acta Arith."},{"issue":"1","key":"10.1016\/j.tcs.2015.02.013_br0030","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(93)E0162-W","article-title":"On polynomial functions from Zn to Zm","volume":"137","author":"Chen","year":"1995","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.tcs.2015.02.013_br0040","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(95)00305-G","article-title":"On polynomial functions from Zn1\u00d7\u2026\u00d7Znr to Zm","volume":"162","author":"Chen","year":"1996","journal-title":"Discrete Math."},{"issue":"1\/6","key":"10.1016\/j.tcs.2015.02.013_br0050","doi-asserted-by":"crossref","first-page":"65","DOI":"10.2307\/1967217","article-title":"The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group","volume":"11","author":"Dickson","year":"1896","journal-title":"Ann. Math."},{"issue":"1","key":"10.1016\/j.tcs.2015.02.013_br0060","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00453-013-9799-7","article-title":"An algorithmic characterization of polynomial functions over Zpn","volume":"71","author":"Guha","year":"2015","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2015.02.013_br0070","first-page":"750","article-title":"Sur les fonctions de sept lettres","volume":"57","author":"Hermite","year":"1863","journal-title":"C. R. Acad. Sci. Paris"},{"issue":"A23","key":"10.1016\/j.tcs.2015.02.013_br0080","article-title":"A generalization of the Smarandache function to several variables","volume":"6","author":"Hungerb\u00fchler","year":"2006","journal-title":"Integers"},{"issue":"4","key":"10.1016\/j.tcs.2015.02.013_br0090","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1215\/S0012-7094-68-03589-8","article-title":"Counting polynomial functions (mod pn)","volume":"35","author":"Keller","year":"1968","journal-title":"Duke Math. J."},{"issue":"2","key":"10.1016\/j.tcs.2015.02.013_br0100","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1090\/S0002-9947-1921-1501173-4","article-title":"Polynomials and their residue systems","volume":"22","author":"Kempner","year":"1921","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.tcs.2015.02.013_br0110","unstructured":"I.L. Lagrange, Reflexions sur la resolution algebrique des equations."},{"key":"10.1016\/j.tcs.2015.02.013_br0120","series-title":"Finite Fields","volume":"vol. 20","author":"Lidl","year":"1997"},{"key":"10.1016\/j.tcs.2015.02.013_br0130","series-title":"Smarandache Notions (Proceedings of the Second International Conference on Smarandache Type Notions in Mathematics and Quantum Physics)","first-page":"19","article-title":"The average Smarandache function","volume":"vol. 12","author":"Luca","year":"2001"},{"issue":"3","key":"10.1016\/j.tcs.2015.02.013_br0140","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01950276","article-title":"Polynomial functions (mod m)","volume":"44","author":"Mullen","year":"1984","journal-title":"Acta Math. Hungar."},{"issue":"5","key":"10.1016\/j.tcs.2015.02.013_br0150","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0022-314X(74)90031-6","article-title":"On polynomial functions (mod m)","volume":"6","author":"Singmaster","year":"1974","journal-title":"J. Number Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515001103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515001103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T21:59:01Z","timestamp":1557439141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397515001103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":15,"alternative-id":["S0304397515001103"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2015.02.013","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A faster algorithm for testing polynomial representability of functions over finite integer rings","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2015.02.013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}