Propositional Proof Complexity: Theory and PracticeWorkshop affiliated with the Federated Logic Conference (FLoC 2010)/ SAT 2010Edinburgh, July 9, 2010 

Home Topics Contact/Committees Important dates Submission Workshop agenda Call for Papers (PDF) 
The PPC workshop is combined with the 11th International Workshop on Logic and Computational Complexity. Propositional proof complexity is an area of mathematics (theoretical computer science) within the intersection of mathematical logic and computational complexity and is centered around the question whether the complexity class NP is closed under complementation. It is tightly connected with other areas like computational complexity theory, automated theorem proving and cryptography. The purpose of the workshop is to bring together researchers in various parts of mathematics and computer science interested in propositional proof complexity. The topic of the workshop will be on propositional proof theory with connections to issues of complexity in the widest sense. Our aim is to expose, through invited and contributed talks, current developments in proof complexity that are most relevant to SATsolving and automated theorem proving. TopicsThe topics of the workshop will be on propositional proof complexity in the widest sense with connections to applications for which complexity issues are essential and include (but are not restricted to):
Invited SpeakersImportant Dates
