{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","description":"Fixed-parameter tractability is a property of computational problems solvable in time bounded by a function of a parameter times a polynomial in input size.","display_name_alternatives":["fixed-parameter tractable","FPT"],"ids":{"openalex":"https://openalex.org/keywords/fixed-parameter-tractability","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7695,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.7695,"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":7491,"cited_by_count":96097,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/fixed-parameter-tractability","updated_date":"2026-10-22T04:07:25","created_date":"2026-09-30T00:00:00"}