Search results
- 1.0353760 - MÚ 2011 RIV GB eng C - Conference Paper (international conference)
Krajíček, Jan
A proof complexity generator.
Logic, Methodology and Philosophy of Science. London: College Publications, 2009 - (Glymour, C.; Wang, W.; Westerstahl, D.), s. 185-190. ISBN 978-1-904987-45-1.
[International Congress in Logic, Methodology and Philosophy of Science /13./. Beijing (CN), 09.08.2007-15.08.2007]
R&D Projects: GA AV ČR IAA1019401; GA MŠMT LC505
Keywords : proof complexity * hard tatologies
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0192913File Download Size Commentary Version Access Krajicek1.pdf 1 98.2 KB Author’s postprint open-access - 2.0353758 - MÚ 2011 RIV DE eng C - Conference Paper (international conference)
Krajíček, Jan
From feasible proofs to feasible computations.
Computer Science Logic 2010. Heidelberg: Springer, 2010 - (Dawar, A.; Veith, H.), s. 22-31. Lecture Notes in Computer Science, 6247. ISBN 978-3-642-15204-7.
[Computer science logic 2010. Brno (CZ), 23.08.2010-27.08.2010]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT LC505
Institutional research plan: CEZ:AV0Z10190503
Keywords : lengths of proofs * computational time
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-15205-4_3
Permanent Link: http://hdl.handle.net/11104/0192912File Download Size Commentary Version Access Krajicek.pdf 1 164.1 KB Publisher’s postprint require