Number of the records: 1
On the complexity of circuit satisfiability
- 1.PATURI, R., PUDLÁK, Pavel. On the complexity of circuit satisfiability. In: 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. Available: doi: 10.1145/1806689.1806724.
Number of the records: 1