Number of the records: 1
On extracting computations from propositional proofs
- 1.
SYSNO 0422140 Title On extracting computations from propositional proofs Author(s) Pudlák, Pavel (MU-W) RID, SAI Source Title IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. S. 30-41. - Wadem : Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2010 / Lodaya K. ; Mahajan M Conference International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), /30./, Chennai, 15.12.2010-16.12.2010 Document Type Konferenční příspěvek (zahraniční konf.) Grant IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic CEZ AV0Z10190503 - MU-W (2005-2011) Language eng Country DE Keywords proof complexity * propositional tautology * boolean circuits URL http://drops.dagstuhl.de/opus/volltexte/2010/2851/ Permanent Link http://hdl.handle.net/11104/0228350 File Download Size Commentary Version Access Pudlak2.pdf 1 424.5 KB Publisher’s postprint open-access
Number of the records: 1