{"doi":"10.1007/978-3-540-69166-2_20","title":"Analysing All Polynomial Equations in ${\\mathbb Z_{2^w}}$","abstract":null,"journal":"Lecture Notes in Computer Science","year":null,"id":24240,"datarank":0.24310262089034526,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"self_citation_contribution":0.16479184330021646,"citation_network_contribution":0.0783107775901288,"self_endowment_contribution":0.16479184330021646,"citer_contribution":0.0783107775901288,"corpus_percentile":null,"corpus_rank":null,"citation_count":2,"citer_count":2,"citers_with_citation_signal":2,"citers_with_endowment":2,"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":146115,"name":"Andrea Flexeder","orcid":null,"position":1,"is_corresponding":false},{"id":146116,"name":"Michael Petter","orcid":null,"position":2,"is_corresponding":false},{"id":146114,"name":"Helmut Seidl","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"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/W131466369","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.02329218,"influential_citations":0,"citation_trend":[{"year":2014,"count":1},{"year":2023,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"https://doi.org/10.1007/978-3-540-69166-2_20","host_type":"book series"}],"fields_of_study":["Cryptographic Implementations and Security","Formal Methods in Verification","Security and Verification in Computing","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Decidability","Polynomial","Bounded function","Time complexity","Reciprocal polynomial","Invariant (physics)","Matrix polynomial","Mathematics","Combinatorics","Square-free polynomial","PSPACE","Discrete mathematics","Wilkinson's polynomial","Algorithm","Computational complexity theory","Mathematical analysis"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-07T21:56:00.949901Z","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":[]}