Number of the records: 1
On the complexity of circuit satisfiability
- 1.0351120 - MÚ 2011 RIV US eng C - Conference Paper (international conference)
Paturi, R. - Pudlák, Pavel
On the complexity of circuit satisfiability.
STOC'10 : Proceedings of the 2010 ACM International Symposium on Theory of Computing. New York: Association for Computing Machinery, 2010, s. 241-249. ISBN 978-1-60558-817-9.
[Symposium on Theory of Computing : STOC'10. Cambridge (US), 05.06.2010-08.06.2010]
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : Circuit satisfiability * NP-completeness
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=1806689.1806724
Permanent Link: http://hdl.handle.net/11104/0190940File Download Size Commentary Version Access Pudlak4.pdf 6 167.3 KB Author’s postprint open-access
Number of the records: 1