{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T16:05:11Z","timestamp":1750089911382,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030521998"},{"type":"electronic","value":"9783030522001"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52200-1_46","type":"book-chapter","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T18:04:48Z","timestamp":1594145088000},"page":"462-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Certifying Irreducibility in $${\\mathbb Z}[x]$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5608-3835","authenticated-orcid":false,"given":"John","family":"Abbott","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"46_CR1","unstructured":"Abbott, J., Bigatti, A.M., Robbiano, L.: CoCoA: a system for doing Computations in Commutative Algebra. \nhttp:\/\/cocoa.dima.unige.it\/"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.jsc.2012.09.004","volume":"50","author":"J Abbott","year":"2013","unstructured":"Abbott, J.: Bounds on factors in $$\\mathbb{Z}[x]$$. J. Symb. Comput. 50, 532\u2013563 (2013)","journal-title":"J. Symb. Comput."},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-15984-3_231","volume-title":"EUROCAL \u201985","author":"J Davenport","year":"1985","unstructured":"Davenport, J., Padget, J.: Heugcd: how elementary upperbounds generate cheaper data. In: Caviness, B.F. (ed.) EUROCAL 1985. LNCS, vol. 204, pp. 18\u201328. Springer, Heidelberg (1985). \nhttps:\/\/doi.org\/10.1007\/3-540-15984-3_231"},{"issue":"2","key":"46_CR4","first-page":"191","volume":"6","author":"G Dumas","year":"1906","unstructured":"Dumas, G.: Sur quelques cas d\u2019irr\u00e9ductibilit\u00e9 des polynomes \u00e0 coefficients rationnels. Journ. de Math. 6(2), 191\u2013258 (1906)","journal-title":"Journ. de Math."},{"key":"46_CR5","unstructured":"Granlund, T., et al.: GNU multiprecision library. \nhttp:\/\/www.gmplib.org\/"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0212031","volume":"12","author":"E Kaltofen","year":"1983","unstructured":"Kaltofen, E., Musser, D.R., Saunders, B.D.: A generalized class of polynomials that are hard to factor. SIAM J. Comput. 12, 473\u2013483 (1983)","journal-title":"SIAM J. Comput."},{"key":"46_CR7","volume-title":"Algebra","author":"S Lang","year":"1993","unstructured":"Lang, S.: Algebra, 3rd edn. Addison Wesley, Reading (1993)","edition":"3"},{"key":"46_CR8","first-page":"288","volume":"132","author":"O Perron","year":"1907","unstructured":"Perron, O.: Neue Kriterien f\u00fcr die Irreduzibilit\u00e4t algebraischer Gleichungen. J. Reine Angew. Math. 132, 288\u2013307 (1907)","journal-title":"J. Reine Angew. Math."},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0204018","volume":"4","author":"VR Pratt","year":"1975","unstructured":"Pratt, V.R.: Every prime has a succinct certificate. SIAM J. Comput. 4, 214\u2013220 (1975)","journal-title":"SIAM J. Comput."},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"431","DOI":"10.4153\/CMB-1964-042-9","volume":"7","author":"E Rowlinson","year":"1964","unstructured":"Rowlinson, E.: New proofs for two theorems of Capelli. Can. Math. Bull. 7, 431\u2013433 (1964)","journal-title":"Can. Math. Bull."}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52200-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T19:09:03Z","timestamp":1594148943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52200-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030521998","9783030522001"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52200-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Congress on Mathematical Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braunschweig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icms2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iaa.tu-bs.de\/AppliedAlgebra\/ICMS2020\/ICMS2020.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.22","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}