[Proof Complexity] new preprint

Jan Krajicek krajicek at karlin.mff.cuni.cz
Tue Dec 11 08:55:45 CET 2012

  Dear colleagues,

  a new preprint of mine entitled "On the computational 
complexity of finding hard tautologies" is available 
via my web page or via the ArXiv (which also displays 
the abstract separately). Comments most welcome.



More information about the Proof-Complexity mailing list