{"id":"https://openalex.org/keywords/propositional-proof-complexity","display_name":"propositional proof complexity","description":"The study of the size and structure of proofs in formal systems for propositional logic, within theoretical computer science and logic.","display_name_alternatives":["proof complexity of propositional logic","complexity of propositional proofs"],"ids":{"openalex":"https://openalex.org/keywords/propositional-proof-complexity","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6222,"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.6222,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.082,"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":174,"cited_by_count":3528,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/propositional-proof-complexity","updated_date":"2026-11-19T04:05:57","created_date":"2026-09-30T00:00:00"}
