{"id":"https://openalex.org/keywords/bpp","display_name":"BPP","description":"A complexity class of decision problems solvable by probabilistic polynomial-time algorithms with error probability bounded below one half.","display_name_alternatives":["bounded-error probabilistic polynomial time","BPP complexity class","bounded-error probabilistic polynomial time complexity class"],"ids":{"openalex":"https://openalex.org/keywords/bpp","wikidata":"https://www.wikidata.org/wiki/Q796890"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3835,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3835,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.1347,"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":552,"cited_by_count":14632,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/bpp","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
