Number of the records: 1
Twelve Problems in Proof Complexity
- 1.0321832 - MÚ 2009 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel
Twelve Problems in Proof Complexity.
[Dvanáct problémů v důkazové složitosti.]
Computer Science - Theory and Applications. Berlin: Springer, 2008 - (Hirsch, E.; Razborov, A.; Semenov, A.; Slissenko, A.), s. 11-27. ISBN 978-3-540-79708-1.
[International Computer Science Symposium in Russia, CSR 2008/3./. Moskva (RU), 07.06.2008-12.06.2008]
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : computational complexity * bounded arithmetic * propositional calculus
Subject RIV: BA - General Mathematics
We illustrate the state of art in proof complexity using twelve problems
S použitím dvanácti problémů ilustrujeme současný stav v důkazové složitosti
Permanent Link: http://hdl.handle.net/11104/0170258
File Download Size Commentary Version Access Pudlak2.pdf 1 449.5 KB Publisher’s postprint require
Number of the records: 1