Search results
- 1.0568260 - MÚ 2023 RIV eng U - Conference, Workshop Arrangement
Hrubeš, Pavel - Koucký, M. - Talebanfard, Navid - Thapen, Neil
Complexity Theory with a Human Face, Third Edition.
[Šindlerův Mlýn, 27.06.2022-01.07.2022, (W-WRD 32/13)]
Institutional support: RVO:67985840
Keywords : complexity theory
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://workshop.math.cas.cz/HumanFace/2022/
Permanent Link: https://hdl.handle.net/11104/0339590 - 2.0563135 - ÚTIA 2023 RIV US eng C - Conference Paper (international conference)
Picek, L. - Novozámský, Adam - Čapková Frydrychová, Radmila - Zitová, Barbara - Mach, P.
Monitoring of Varroa Infestation rate in Beehives: A Simple AI Approach.
IEEE International Conference on Image Processing 2022 : Proceedings. Piscataway: IEEE, 2022, s. 3341-3345. ISBN 978-1-6654-9620-9. ISSN 2381-8549.
[IEEE International Conference on Image Processing 2022 /29./. Bordeaux (FR), 16.10.2022-19.10.2022]
Grant - others:AV ČR(CZ) StrategieAV21/1
Program: StrategieAV
Institutional support: RVO:67985556 ; RVO:60077344
Keywords : Machine learning algorithms * Costs * Image processing * Machine learning * Frequency measurement * Complexity theory
OECD category: Computer hardware and architecture; Zoology (BC-A)
http://library.utia.cas.cz/separaty/2022/ZOI/novozamsky-0563135.pdf
Permanent Link: https://hdl.handle.net/11104/0336399 - 3.0555809 - MÚ 2022 RIV eng U - Conference, Workshop Arrangement
Hrubeš, Pavel - Koucký, M. - Talebanfard, Navid
Complexity Theory with a Human Face, 2nd Edition.
[Špindlerův Mlýn, 17.10.2021-20.10.2021, (W-WRD 30/15)]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : complexity theory
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://workshop.math.cas.cz/HumanFace/2021/
Permanent Link: http://hdl.handle.net/11104/0330261 - 4.0545830 - MÚ 2022 RIV US eng J - Journal Article
Gavinsky, Dmitry
Bare quantum simultaneity versus classical interactivity in communication complexity.
IEEE Transactions on Information Theory. Roč. 67, č. 10 (2021), s. 6583-6605. ISSN 0018-9448. E-ISSN 1557-9654
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : communication complexity * complexity theory * quantum communication
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 2.978, year: 2021
Method of publishing: Limited access
https://doi.org/10.1109/TIT.2021.3050528
Permanent Link: http://hdl.handle.net/11104/0322473File Download Size Commentary Version Access Gavinsky.pdf 2 733.3 KB Publisher’s postprint require - 5.0539971 - MÚ 2021 RIV eng U - Conference, Workshop Arrangement
Hrubeš, Pavel - Koucký, M. - Pich, Ján - Talebanfard, Navid
Complexity Theory with a Human Face.
[Tabor, 02.09.2020-04.09.2020, (W-WRD 30/15)]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : complexity theory
OECD category: Pure mathematics
https://workshop.math.cas.cz/HumanFace/2020/
Permanent Link: http://hdl.handle.net/11104/0317660 - 6.0507203 - ÚI 2020 DE eng J - Journal Article
Pich, Ján
Logical Strength of Complexity Theory and a Formalization of the PCP Theorem in Bounded Arithmetic.
Logical Methods in Computer Science. Roč. 11, č. 2 (2015), č. článku 8. ISSN 1860-5974. E-ISSN 1860-5974
Keywords : weak pigeonhole principle * provability * hardness * np * Bounded arithmetic * Complexity theory * Formalizations
Impact factor: 0.569, year: 2015
Permanent Link: http://hdl.handle.net/11104/0298247 - 7.0503852 - ÚI 2020 RIV NL eng J - Journal Article
Moraschini, Tommaso
On the complexity of the Leibniz hierarchy.
Annals of Pure and Applied Logic. Roč. 170, č. 7 (2019), s. 805-824. ISSN 0168-0072. E-ISSN 1873-2461
R&D Projects: GA ČR GBP202/12/G061; GA MŠMT(CZ) EF17_050/0008361
Institutional support: RVO:67985807
Keywords : Abstract algebraic logic * Leibniz hierarchy * Algebraizable logic * Protoalgebraic logic * Complexity theory
OECD category: Pure mathematics
Impact factor: 0.752, year: 2019
Method of publishing: Limited access
http://dx.doi.org/10.1016/j.apal.2019.02.003
Permanent Link: http://hdl.handle.net/11104/0295627File Download Size Commentary Version Access a0503852.pdf 9 450.9 KB Publisher’s postprint require - 8.0427502 - MÚ 2015 US eng C - Conference Paper (international conference)
Gavinsky, Dmitry - Ito, T. - Guoming, W.
Shared randomness and quantum communication in the multi-party model.
IEEE Conference on Computational Complexity 2013. Washington: IEEE, 2013, s. 34-43. ISBN 978-1-4673-6466-9.
[IEEE Conference on Computational Complexity 2013. Palo Alto (US), 05.06.2013-07.06.2013]
Keywords : complexity theory * computational modeling * communication complexity
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597747
Permanent Link: http://hdl.handle.net/11104/0233030File Download Size Commentary Version Access Gavinsky.pdf 1 252.9 KB Publisher’s postprint require - 9.0175121 - MU-W 20025172 CZ cze D - Thesis
Sgall, Jiří
Kombinatorické problémy v teorii složitosti.
[Combinatorial Problems in Complexity Theory.]
Matematicko-fyzikální fakulta UK. 20010214. - Praha: Matematický ústav AV ČR, 2001. 170 s.
Keywords : complexity theory%combinatorial problems
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072110 - 10.0022096 - MÚ 2006 RIV DE eng J - Journal Article
Krajíček, Jan
Hardness assumptions in the foundations of theoretical computer science.
[Předpoklady obtížnosti v základech teoretické informatiky.]
Archive for Mathematical Logic. Roč. 44, č. 6 (2005), s. 667-675. ISSN 0933-5846. E-ISSN 1432-0665
R&D Projects: GA AV ČR(CZ) IAA1019901; GA MŠMT(CZ) LN00A056
Institutional research plan: CEZ:AV0Z10190503
Keywords : complexity theory * circuit complexity * hardness assumptions
Subject RIV: BA - General Mathematics
Impact factor: 0.523, year: 2003
Permanent Link: http://hdl.handle.net/11104/0110889File Download Size Commentary Version Access Krajicek.pdf 1 144.5 KB Publisher’s postprint require