{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:16:47Z","timestamp":1672291007921},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSAM Bull."],"published-print":{"date-parts":[[2004,12]]},"abstract":"<jats:p>We study the problem of bounding a polynomial which is absolutely irreducible, away from polynomials which are not absolutely irreducible. These separation bounds are useful for testing whether an empirical polynomial is absolutely irreducible or not, for the given tolerance or error bound of its coefficients. Kaltofen and May studied a method which finds applicable separation bounds using an absolute irreducibility criterion due to Ruppert. In this paper, we study some improvements on their method, by which we are able to find more accurate separation bounds, for bivariate polynomials.<\/jats:p>","DOI":"10.1145\/1060328.1060330","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"119-129","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards more accurate separation bounds of empirical polynomials"],"prefix":"10.1145","volume":"38","author":[{"given":"Kosaku","family":"Nagasaka","sequence":"first","affiliation":[{"name":"Kobe University, Nada-ku, Kobe, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-314X(03)00044-1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1023"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860893"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780531"},{"key":"e_1_2_1_5_1","first-page":"283","volume-title":"Proceedings of the 2003 Workshop on Computer Algebra in Scientific Computing","author":"Nagasaka K.","year":"2003"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1999.2381"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/384101.384139"}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060328.1060330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T17:05:44Z","timestamp":1672247144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060328.1060330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1145\/1060328.1060330"],"URL":"https:\/\/doi.org\/10.1145\/1060328.1060330","relation":{},"ISSN":["0163-5824"],"issn-type":[{"value":"0163-5824","type":"print"}],"subject":[],"published":{"date-parts":[[2004,12]]},"assertion":[{"value":"2004-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}