{"doi":"10.1007/bf02112431","title":"Algorithm of polynomial complexity for factoring polynomials over local fields","abstract":null,"journal":"Journal of Mathematical Sciences","year":1994,"id":24241,"datarank":1.201891933492432,"base_score":2.639057329615259,"endowment":2.639057329615259,"self_citation_contribution":0.3958585994422889,"citation_network_contribution":0.8060333340501432,"self_endowment_contribution":0.3958585994422889,"citer_contribution":0.8060333340501432,"corpus_percentile":null,"corpus_rank":null,"citation_count":13,"citer_count":13,"citers_with_citation_signal":11,"citers_with_endowment":11,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":146117,"name":"A. L. Chistov","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.639057329615259,"endowment":2.639057329615259,"datacite_reuse_total":0,"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/W2077346602","authors":[],"funders":[],"total_grants":0,"fwci":0.5647,"citation_percentile":0.75919034,"influential_citations":0,"citation_trend":[{"year":2013,"count":1},{"year":2014,"count":1},{"year":2019,"count":2},{"year":2020,"count":1},{"year":2022,"count":1},{"year":2024,"count":1}],"oa_status":"bronze","license":"http://www.springer.com/tdm","oa_locations":[{"url":"https://link.springer.com/content/pdf/10.1007/BF02112431.pdf","host_type":"journal"},{"url":"https://link.springer.com/content/pdf/10.1007/BF02112431.pdf","host_type":"BRONZE"},{"url":"https://link.springer.com/content/pdf/10.1007/BF02112431.pdf","host_type":"publisher"},{"url":"http://link.springer.com/content/pdf/10.1007/BF02112431.pdf","host_type":"publisher"},{"url":"http://link.springer.com/article/10.1007/BF02112431/fulltext.html","host_type":"publisher"},{"url":"http://link.springer.com/content/pdf/10.1007/BF02112431","host_type":"publisher"},{"url":"https://doi.org/10.1007/bf02112431","host_type":"journal"}],"fields_of_study":["Coding theory and cryptography","Cryptography and Residue Arithmetic","Polynomial and algebraic computation","Mathematics"],"mesh_terms":[],"keywords":["Mathematics","Polynomial","Reciprocal polynomial","Factorization of polynomials","Factoring","Finite field","Square-free polynomial","Polynomial matrix","Matrix polynomial","Field (mathematics)","Notation","Monic polynomial","Irreducible polynomial","Time complexity","Discrete mathematics","Algebra over a field","Pure mathematics","Mathematical analysis","Arithmetic"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-07T21:56:06.488060Z","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,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}