Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem

0369682 - MÚ 2012 RIV DE eng J - Článek v odborném periodiku
Thapen, Neil
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.
Archive for Mathematical Logic. Roč. 50, 7-8 (2011), s. 665-680. ISSN 0933-5846. E-ISSN 1432-0665
Grant CEP: GA AV ČR IAA100190902; GA MŠMT LC505; GA MŠMT(CZ) 1M0545
Výzkumný záměr: CEZ:AV0Z10190503
Klíčová slova: bounded arithmetic * proof complexity * search problems
Kód oboru RIV: BA - Obecná matematika
Impakt faktor: 0.341, rok: 2011
http://www.springerlink.com/content/l19kr20362065t86/

Trvalý link: http://hdl.handle.net/11104/0203691