Počet záznamů: 1
On the complexity of circuit satisfiability
- 1.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]
http://dl.acm.org/citation.cfm?doid=1806689.1806724
http://hdl.handle.net/11104/0190940
Počet záznamů: 1