{"id":"https://openalex.org/keywords/approximate-gcd","display_name":"approximate GCD","description":"An approximate greatest common divisor is a polynomial or integer common divisor computed under a tolerance when inputs are nearly, but not exactly, divisible.","display_name_alternatives":["approximate GCDs","AGCD"],"ids":{"openalex":"https://openalex.org/keywords/approximate-gcd","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.8234,"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.8234,"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"}}],"works_count":108,"cited_by_count":1107,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/approximate-gcd","updated_date":"2026-11-19T04:05:57","created_date":"2026-09-30T00:00:00"}
