{"doi":"10.1137/0210061","title":"Completeness, Approximation and Density","abstract":null,"journal":"SIAM Journal on Computing","year":1981,"id":24242,"datarank":7.654269359083863,"base_score":4.48863636973214,"endowment":4.48863636973214,"self_citation_contribution":0.6732954554598211,"citation_network_contribution":6.980973903624042,"self_endowment_contribution":0.6732954554598211,"citer_contribution":6.980973903624042,"corpus_percentile":null,"corpus_rank":null,"citation_count":88,"citer_count":84,"citers_with_citation_signal":63,"citers_with_endowment":63,"datacite_reuse_total":0,"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":146119,"name":"Daniel Moore","orcid":null,"position":1,"is_corresponding":false},{"id":146118,"name":"Ker-I Ko","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":4.48863636973214,"endowment":4.48863636973214,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W2087899564","authors":[],"funders":[],"total_grants":0,"fwci":3.9044,"citation_percentile":0.94292694,"influential_citations":7,"citation_trend":[{"year":2014,"count":3},{"year":2015,"count":1},{"year":2017,"count":1},{"year":2019,"count":1},{"year":2020,"count":2},{"year":2023,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://epubs.siam.org/doi/pdf/10.1137/0210061","host_type":"publisher"},{"url":"https://doi.org/10.1137/0210061","host_type":"journal"}],"fields_of_study":["Computability, Logic, AI Algorithms","semigroups and automata theory","Complexity and Algorithms in Graphs","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Time complexity","Mathematics","Completeness (order theory)","Polynomial","Wilkinson's polynomial","Discrete mathematics","Reciprocal polynomial","Stable polynomial","Combinatorics","Set (abstract data type)","Matrix polynomial","Square-free polynomial","Computer science","Mathematical analysis"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Decent work and economic growth"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-07T21:56:18.219391Z","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":[]}