{"doi":"10.1137/0214035","title":"Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization","abstract":null,"journal":"SIAM Journal on Computing","year":1985,"id":24238,"datarank":8.650099629472823,"base_score":4.882801922586371,"endowment":4.882801922586371,"self_citation_contribution":0.7324202883879557,"citation_network_contribution":7.917679341084868,"self_endowment_contribution":0.7324202883879557,"citer_contribution":7.917679341084868,"corpus_percentile":null,"corpus_rank":null,"citation_count":131,"citer_count":112,"citers_with_citation_signal":98,"citers_with_endowment":98,"datacite_reuse_total":1,"is_dataset":false,"is_dataset_confidence":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":146100,"name":"Erich Kaltofen","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":4.882801922586371,"endowment":4.882801922586371,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W1980267752","authors":[],"funders":[],"total_grants":0,"fwci":11.1168,"citation_percentile":0.9816339,"influential_citations":5,"citation_trend":[{"year":2012,"count":2},{"year":2013,"count":6},{"year":2014,"count":7},{"year":2015,"count":4},{"year":2016,"count":1},{"year":2017,"count":2},{"year":2018,"count":3},{"year":2019,"count":2},{"year":2020,"count":5},{"year":2021,"count":2},{"year":2022,"count":3},{"year":2023,"count":5},{"year":2024,"count":4},{"year":2025,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://epubs.siam.org/doi/pdf/10.1137/0214035","host_type":"publisher"},{"url":"https://doi.org/10.1137/0214035","host_type":"journal"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7949","host_type":""}],"fields_of_study":["Coding theory and cryptography","Cryptography and Residue Arithmetic","Polynomial and algebraic computation","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Factorization of polynomials","Mathematics","Univariate","Irreducible polynomial","Monic polynomial","Polynomial","Irreducibility","Reciprocal polynomial","Factorization","Square-free polynomial","Matrix polynomial","Stable polynomial","Polynomial matrix","Minimal polynomial (linear algebra)","Combinatorics","Degree of a polynomial","Discrete mathematics","Multivariate statistics","Pure mathematics","Mathematical analysis","Algorithm","Statistics"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/lipics.esa.2018.66","title":"On Learning Linear Functions from Subset and Its Applications in Quantum Computing","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-07T21:55:48.330594Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}