A note on SAT algorithms and proof complexity

Number of the records: 1

1.

SYSNO	0380502
Title	A note on SAT algorithms and proof complexity
Author(s)	Krajíček, Jan (MU-W)_{SAI, ORCID}
Source Title	Information Processing Letters. Roč. 112, č. 12 (2012), s. 490-493. - : Elsevier
Document Type	Článek v odborném periodiku
Grant	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	NL
Keywords	computational complexity
URL	http://www.sciencedirect.com/science/article/pii/S0020019012000774
Permanent Link	http://hdl.handle.net/11104/0211194

	File	Download	Size	Commentary	Version	Access
	Krajicek1.pdf	3	136.5 KB		Publisher’s postprint	require

Number of the records: 1