Number of the records: 1

Complexity of Propositional Proofs Under a Promise

SYSNO	0343940
Title	Complexity of Propositional Proofs Under a Promise
Author(s)	Dershowitz, N. (IL) Tzameret, Iddo (MU-W)_SAI
Source Title	ACM Transactions on Computational Logic. Roč. 11, č. 3 (2010), s. 1-29. - : Association for Computing Machinery
Document Type	Článek v odborném periodiku
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	US
Keywords	theory * promise problems * propositional proof complexity * random 3CNF * resolution
URL	http://dl.acm.org/citation.cfm?doid=1740582.1740586
Permanent Link	http://hdl.handle.net/11104/0186297

	File	Download	Size	Commentary	Version	Access
	Tzameret1.pdf	1	248.6 KB		Publisher’s postprint	require

Number of the records: 1