Search results
- 1.0588526 - MÚ 2025 RIV DE eng C - Conference Paper (international conference)
Gurumukhani, M. - Paturi, R. - Pudlák, Pavel - Saks, M. - Talebanfard, Navid
Local enumeration and majority lower bounds.
39th Computational Complexity Conference (CCC 2024). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2024 - (Santhanam, S.), č. článku 17. Leibniz International Proceedings in Informatics, 300. ISBN 978-3-95977-331-7. E-ISSN 1868-8969.
[39th Computational Complexity Conference (CCC 2024). Ann Arbor (US), 22.07.2024-25.07.2024]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : circuit lower bounds * depth 3 circuits * k-CNF satisfiability * majority function
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.4230/LIPIcs.CCC.2024.17
Permanent Link: https://hdl.handle.net/11104/0355395File Download Size Commentary Version Access Pudlak.pdf 0 912.7 KB Publisher’s postprint open-access - 2.0395301 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Bulánek, Jan - Koucký, Michal - Saks, M.
On randomized online labeling with polynomially many labels.
Automata, Languages, and Programming. Part I. Berlin: Springer, 2013 - (Fomin, F.; Freivalds, R.; Kwiatkowska, M.; Peleg, D.), s. 291-302. Lecture Notes in Computer Science, 7965. ISBN 978-3-642-39205-4.
[International Colloquium, ICALP 2013 /40./. Riga (LT), 08.07.2013-12.07.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : online labeling * complexity
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-39206-1_25
Permanent Link: http://hdl.handle.net/11104/0223374File Download Size Commentary Version Access Bulanek1.pdf 1 221.1 KB Publisher’s postprint require - 3.0386313 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Bulánek, Jan - Koucký, Michal - Saks, M.
Tight lower bounds for the online labeling problem.
Proceedings of the 44th Symposium on Theory of Computing, STOC'2012. New York: ACM, 2012 - (Karloff, H.; Pitassi, T.), s. 1185-1198. ISBN 978-1-4503-1245-5.
[STOC'12 Symposium on Theory of Computing Conference /44./. New York (US), 19.05.2012-22.05.2012]
R&D Projects: GA ČR GAP202/10/0854
Institutional support: RVO:67985840
Keywords : online labeling * file maintenance problem * lower bounds
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?id=2213977.2214083&coll=DL&dl=GUIDE&CFID=245194486&CFTOKEN=14126751
Permanent Link: http://hdl.handle.net/11104/0219391File Download Size Commentary Version Access Koucky2.pdf 10 315.4 KB Author’s postprint require - 4.0382019 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Babka, M. - Bulánek, Jan - Čunát, V. - Koucký, Michal - Saks, M.
On online labeling with polynomially many labels.
Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Berlin: Springer, 2012 - (Epstein, L.; Ferragina, P.), s. 121-132. Lecture Notes in Computer Science, 7501. ISBN 978-3-642-33089-6.
[20th Annual European Symposium on Algorithms (ESA 2012). Ljubljana (SI), 10.09.2012-12.09.2012]
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : online labeling * file maintenance problem * lower bounds
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007/978-3-642-33090-2_12
Permanent Link: http://hdl.handle.net/11104/0215656File Download Size Commentary Version Access Koucky1.pdf 1 235.2 KB Publisher’s postprint require