{"id":"https://openalex.org/keywords/pseudo-polynomial-time-algorithm","display_name":"pseudo-polynomial time algorithm","description":"An algorithm whose running time is polynomial in the numerical magnitudes of input values, but may be exponential in their bit-lengths.","display_name_alternatives":["pseudopolynomial time algorithm","pseudo-polynomial algorithm","pseudopolynomial algorithm","pseudo-polynomial time algorithms","pseudopolynomial algorithms"],"ids":{"openalex":"https://openalex.org/keywords/pseudo-polynomial-time-algorithm","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.2953,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.2953,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2815,"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":1484,"cited_by_count":32660,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/pseudo-polynomial-time-algorithm","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
