On the complexity of circuit satisfiability

Number of the records: 1

1.

SYSNO	0351120
Title	On the complexity of circuit satisfiability
Author(s)	Paturi, R. (US) Pudlák, Pavel (MU-W)_{RID, SAI}
Source Title	STOC'10 : Proceedings of the 2010 ACM International Symposium on Theory of Computing. S. 241-249. - New York : Association for Computing Machinery, 2010
Conference	Symposium on Theory of Computing : STOC'10, Cambridge, 05.06.2010-08.06.2010
Document Type	Konferenční příspěvek (zahraniční konf.)
Grant	1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	US
Keywords	Circuit satisfiability * NP-completeness
URL	http://dl.acm.org/citation.cfm?doid=1806689.1806724
Permanent Link	http://hdl.handle.net/11104/0190940

	File	Download	Size	Commentary	Version	Access
	Pudlak4.pdf	6	167.3 KB		Author’s postprint	open-access

Number of the records: 1