Number of the records: 1

From feasible proofs to feasible computations

SYSNO	0353758
Title	From feasible proofs to feasible computations
Author(s)	Krajíček, Jan (MU-W)_{SAI, ORCID}
Source Title	Computer Science Logic 2010. S. 22-31. - Heidelberg : Springer, 2010 / Dawar A. ; Veith H.
Conference	Computer science logic 2010, Brno, 23.08.2010-27.08.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)
	LC505 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	DE
Keywords	lengths of proofs * computational time
URL	http://link.springer.com/chapter/10.1007%2F978-3-642-15205-4_3
Permanent Link	http://hdl.handle.net/11104/0192912

	File	Download	Size	Commentary	Version	Access
	Krajicek.pdf	1	164.1 KB		Publisher’s postprint	require

Number of the records: 1