Number of the records: 1

On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function

SYSNO	0369662
Title	On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function
Author(s)	Krajíček, Jan (MU-W)_{SAI, ORCID}
Source Title	Journal of Mathematical Logic. Roč. 11, č. 1 (2011), s. 11-27. - : World Scientific Publishing
Document Type	Článek v odborném periodiku
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	SG
Keywords	proof complexity * Nisan-Wigderson generator
URL	http://www.worldscinet.com/jml/11/1101/S0219061311000979.html
Permanent Link	http://hdl.handle.net/11104/0203675

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

Number of the records: 1