Request file

Review/Citation:  LOKSHTANOV, D., MIKHAILIN, I., RAMAMOHAN, P., PUDLÁK, Pavel. Beating brute force for (quantified) satisfiability of circuits of bounded treewidth. In: CZUMAJ, A., ed. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: SIAM, 2018, s. 247-261. ISBN 978-1-61197-503-1
Requested document:  Pudlak.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.