Search results
- 1.0489223 - MÚ 2019 RIV US eng C - Conference Paper (international conference)
Lokshtanov, D. - Mikhailin, I. - Ramamohan, P. - Pudlák, Pavel
Beating brute force for (quantified) satisfiability of circuits of bounded treewidth.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: SIAM, 2018 - (Czumaj, A.), s. 247-261. ISBN 978-1-61197-503-1.
[Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018). New Orleans (US), 07.01.2018-10.01.2018]
Institutional support: RVO:67985840
Keywords : algorithmic properties of circuits of bounded treewidth
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://epubs.siam.org/doi/abs/10.1137/1.9781611975031.18
Permanent Link: http://hdl.handle.net/11104/0283675File Download Size Commentary Version Access Pudlak.pdf 2 624.9 KB Publisher’s postprint require - 2.0434135 - MÚ 2015 RIV DE eng C - Conference Paper (international conference)
Gavinsky, Dmitry - Lovett, S.
En route to the log-rank conjecture: new reductions and equivalent formulations.
Automata, Languages, and Programming. Berlin: Springer, 2014 - (Esparza, J.; Fraigniaud, P.; Husfeldt, T.; Koutsoupias, E.), s. 514-524. Lecture Notes in Computer Science, 8572. ISBN 978-3-662-43947-0.
[41st International Colloquium, ICALP 2014. Copenhagen (DK), 08.07.2014-11.07.2014]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : automata theory * matrix algebra * associated matrices * communication complexity
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-662-43948-7_43
Permanent Link: http://hdl.handle.net/11104/0238256File Download Size Commentary Version Access Gavinsky1.pdf 1 213.8 KB Publisher’s postprint require