The provably total search problems of bounded arithmetic

0369680 - MÚ 2012 RIV GB eng J - Journal Article
Skelley, A. - Thapen, Neil
The provably total search problems of bounded arithmetic.
Proceedings of the London Mathematical Society. Roč. 103, č. 1 (2011), s. 106-138. ISSN 0024-6115. E-ISSN 1460-244X
R&D Projects: GA MŠMT LC505
Institutional research plan: CEZ:AV0Z10190503
Keywords : Pigeonhole principle * polynomial hierarchy * local search
Subject RIV: BA - General Mathematics
Impact factor: 1.324, year: 2011
http://plms.oxfordjournals.org/content/103/1/106

Permanent Link: http://hdl.handle.net/11104/0203689