{"id":"https://openalex.org/W7165922331","doi":"https://doi.org/10.5281/zenodo.20846736","title":"A Probabilistic Algorithm of Computing the Polynomial Greatest Common Divisor with Smaller Factors","display_name":"A Probabilistic Algorithm of Computing the Polynomial Greatest Common Divisor with Smaller Factors","publication_year":2022,"publication_date":"2022-11-02","ids":{"openalex":"https://openalex.org/W7165922331","doi":"https://doi.org/10.5281/zenodo.20846736"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.20846736","doi":"https://doi.org/10.5281/zenodo.20846736","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.20846736","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.20846736","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139305264","display_name":"yangzhang","orcid":"https://orcid.org/0009-0005-0208-2964","observed_orcids":["https://orcid.org/0009-0005-0208-2964"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"yangzhang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0005-0208-2964","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062405580","display_name":"Qiangwei Xin","orcid":"https://orcid.org/0009-0000-8812-6182","observed_orcids":["https://orcid.org/0009-0000-8812-6182"]},"institutions":[{"id":"https://openalex.org/I4210118093","display_name":"Xianyang Normal University","ror":"https://ror.org/01r45yt97","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210118093"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiangwei Xin","raw_affiliation_strings":["Xianyang Normal University"],"raw_orcid":"https://orcid.org/0009-0000-8812-6182","affiliations":[{"raw_affiliation_string":"Xianyang Normal University","institution_ids":["https://openalex.org/I4210118093"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052577193","display_name":"Qidi You","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"you, qidi","raw_affiliation_strings":["Tsinghua University"],"raw_orcid":"https://orcid.org/0009-0003-8375-0340","affiliations":[{"raw_affiliation_string":"Tsinghua University","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139315811","display_name":"Xuanhong Zhou","orcid":"https://orcid.org/0009-0007-1012-986X","observed_orcids":["https://orcid.org/0009-0007-1012-986X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Xuanhong","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0007-1012-986X","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139340523","display_name":"zhang xiyong","orcid":"https://orcid.org/0000-0002-2428-8382","observed_orcids":["https://orcid.org/0000-0002-2428-8382"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"xiyong, zhang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2428-8382","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100423359","display_name":"Yang Wang","orcid":"https://orcid.org/0000-0003-1588-3208","observed_orcids":["https://orcid.org/0000-0003-1588-3208","https://orcid.org/0009-0000-3185-5384"]},"institutions":[{"id":"https://openalex.org/I4210097637","display_name":"Tangshan People's Hospital","ror":"https://ror.org/00xw2x114","country_code":"CN","type":"healthcare","lineage":["https://openalex.org/I4210097637"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wang, Yang","raw_affiliation_strings":["Tangshan People's Hospital"],"raw_orcid":"https://orcid.org/0009-0002-6294-0092","affiliations":[{"raw_affiliation_string":"Tangshan People's Hospital","institution_ids":["https://openalex.org/I4210097637"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13806","display_name":"Mathematical and Computational Methods","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial-greatest-common-divisor","display_name":"polynomial greatest common divisor","score":0.9819999933242798},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.8429999947547913},{"id":"https://openalex.org/keywords/integer-polynomials","display_name":"integer polynomials","score":0.628000020980835},{"id":"https://openalex.org/keywords/euclidean-algorithm","display_name":"Euclidean algorithm","score":0.7960000038146973},{"id":"https://openalex.org/keywords/coefficient-growth","display_name":"coefficient growth","score":0.8809999823570251}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6708999872207642},{"id":"https://openalex.org/C125257309","wikidata":"https://www.wikidata.org/wiki/Q131752","display_name":"Greatest common divisor","level":2,"score":0.6543999910354614},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6531000137329102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6194999814033508},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5981000065803528},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.487199991941452},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47589999437332153},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4745999872684479},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.42489999532699585},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4066999852657318},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3407999873161316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33899998664855957},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.31839999556541443},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3122999966144562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30820000171661377},{"id":"https://openalex.org/C60782215","wikidata":"https://www.wikidata.org/wiki/Q3333679","display_name":"Probabilistic method","level":3,"score":0.2976999878883362},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C23719512","wikidata":"https://www.wikidata.org/wiki/Q867345","display_name":"Euclidean domain","level":4,"score":0.2526000142097473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5281/zenodo.20846736","doi":"https://doi.org/10.5281/zenodo.20846736","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.20846736","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},{"id":"doi:10.5281/zenodo.22247345","doi":"https://doi.org/10.5281/zenodo.22247345","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.22247345","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},{"id":"doi:10.5281/zenodo.22247346","doi":"https://doi.org/10.5281/zenodo.22247346","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.22247346","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"}],"best_oa_location":{"id":"doi:10.5281/zenodo.20846736","doi":"https://doi.org/10.5281/zenodo.20846736","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.20846736","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4304190050","https://openalex.org/W7096419404","https://openalex.org/W2070866504","https://openalex.org/W7071897923","https://openalex.org/W1044407198","https://openalex.org/W2783393550","https://openalex.org/W1527913126","https://openalex.org/W2027319428","https://openalex.org/W7100084764","https://openalex.org/W2029685321"],"abstract_inverted_index":{"Abstract:":[0],"In":[1,89],"the":[2,11,15,21,48,63,72,82,100,160,173],"earlier":[3],"work,":[4],"subresultant":[5,42,49],"algorithm":[6,17,43,50,97],"was":[7,44,67],"proposed":[8,74],"to":[9,34,61,70,85,98],"decrease":[10],"coefficient":[12],"growth":[13],"in":[14,51,104],"Euclidean":[16],"of":[18,113,164],"polynomials.":[19],"However,":[20],"output":[22],"polynomial":[23],"remainders":[24],"may":[25],"have":[26],"a":[27,57,68,95,109],"small":[28,64],"factor":[29],"which":[30,167],"can":[31],"be":[32],"removed":[33],"satisfy":[35],"our":[36,165],"needs.":[37],"Then":[38],"later,":[39],"an":[40],"improved":[41],"given":[45,118],"by":[46,75,107],"representing":[47],"another":[52],"way,":[53],"where":[54,127],"we":[55,92,156],"add":[56],"variant":[58,73,101],"called":[59],"\ud835\udf0f":[60,102],"express":[62],"factor.":[65],"There":[66],"way":[69,83],"compute":[71],"Brown,":[76],"who":[77],"worked":[78],"at":[79],"IBM.":[80],"Nevertheless,":[81],"failed":[84],"determine":[86,99],"each\ud835\udf0f":[87],"correctly.":[88],"this":[90],"paper,":[91],"will":[93],"give":[94],"probabilistic":[96],"correctly":[103],"most":[105],"cases":[106],"adding":[108],"few":[110],"steps":[111],"instead":[112],"computing":[114],"\ud835\udc61":[115,128,137,146],"\ud835\udc65":[116,120,122,125,129,133,135,138,140,143,147,150,153],"when":[117],"\ud835\udc53":[119,134],"and\ud835\udc54":[121],"\u2208":[123,151],"\u2124":[124,152],",":[126,144,148,155],"satisfies":[130],"that":[131],"\ud835\udc60":[132,149],"+":[136],"\ud835\udc54":[139],"=":[141],"\ud835\udc5f":[142],"here":[145],".Also":[154],"made":[157],"experiments":[158],"on":[159],"correctness":[161],"and":[162],"efficiency":[163],"algorithm,":[166],"has":[168],"obvious":[169],"advantage":[170],"compared":[171],"with":[172],"previous":[174],"fastest":[175],"algorithm.":[176]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-06-26T00:00:00"}