82
Voted
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...