Hermann Haeusler

Reducing super-polynomial proofs in Classical Propositional Logic

In this talk we show and discuss some results on reducing super-polynomially sized proofs of Classical Propositional Logic tautologies to polynomially sized.

TecMF: Talks_17_04_15 (last edited 2015-07-15 18:16:19 by HugoMacedo)