SLA AppliedPub Date : 1900-01-01DOI: 10.1017/9781108559263.009
{"title":"Production and Monitoring of the L2","authors":"","doi":"10.1017/9781108559263.009","DOIUrl":"https://doi.org/10.1017/9781108559263.009","url":null,"abstract":"","PeriodicalId":317092,"journal":{"name":"SLA Applied","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123423137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SLA AppliedPub Date : 1900-01-01DOI: 10.1017/9781108559263.008
{"title":"Comprehension of the L2","authors":"","doi":"10.1017/9781108559263.008","DOIUrl":"https://doi.org/10.1017/9781108559263.008","url":null,"abstract":"","PeriodicalId":317092,"journal":{"name":"SLA Applied","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133891879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SLA AppliedPub Date : 1900-01-01DOI: 10.1017/9781108559263.003
Alejandro Erickson, Michael Monagan
{"title":"Input","authors":"Alejandro Erickson, Michael Monagan","doi":"10.1017/9781108559263.003","DOIUrl":"https://doi.org/10.1017/9781108559263.003","url":null,"abstract":"# A is a polynomial in Z[x] # L is a list of monic images mod p k # p is a prime, B is a bound on the coefficients of the factors of A N ← |L| if lcoeff(a) = 1 then m ← Π N i=1 tcoeff(L i) (mod p k) if m |tcoeff(a) then return false m ← ΠL, q ← a prime q = p if lcoeff(a) = 1 then m ← integer ratrecon(m) if m =FAIL then return false else m ← integer primitive part(m) if m ∞ > B then return false if lcoeff(m) | lcoeff(a) then return false if m |a (mod q) then return false if m|a then Q ← quotient, M ← m, return true end 'factorrpoly' In brief the rest of the algorithm is as follows: 1. Input A ∈ Z[x] 2. Remove integer content 3. Find square free factorizations mod log (deg A) primes 4. Pick \" best \" prime (see example) 5. Lift monic modular images, trial dividing at each step, use rational reconstruction if necessary 6. Trial divide combinations of the remaining \" bad \" factors until all factors in Z[x] have been found 7. Return factors in Z[x] from each square free factor and content from step 2","PeriodicalId":317092,"journal":{"name":"SLA Applied","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114342260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}