0422140 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Pudlák, PavelOn extracting computations from propositional proofs.
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Wadem: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2010 - (Lodaya, K.; Mahajan, M.), s. 30-41. Leibniz International Proceedings in Informatics, vol. 8. ISBN 978-3-939897-23-1.
[International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), /30./. Chennai (IN), 15.12.2010-16.12.2010]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : proof complexity * propositional tautology * boolean circuits
Subject RIV: BA - General Mathematics
http://drops.dagstuhl.de/opus/volltexte/2010/2851/
Permanent Link: http://hdl.handle.net/11104/0228350
