Number of the records: 1

The provably total search problems of bounded arithmetic

SYSNO	0369680
Title	The provably total search problems of bounded arithmetic
Author(s)	Skelley, A. (CA) Thapen, Neil (MU-W)_{RID, SAI}
Source Title	Proceedings of the London Mathematical Society. Roč. 103, č. 1 (2011), s. 106-138
Document Type	Článek v odborném periodiku
Grant	LC505 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	GB
Keywords	Pigeonhole principle * polynomial hierarchy * local search
URL	http://plms.oxfordjournals.org/content/103/1/106
Permanent Link	http://hdl.handle.net/11104/0203689

	File	Download	Size	Commentary	Version	Access
	Thapen2.pdf	6	329.4 KB		Publisher’s postprint	require

Number of the records: 1