Search results
- 1.0574198 - MÚ 2024 RIV US eng J - Journal Article
Folwarczný, Lukáš
On protocols for monotone feasible interpolation.
ACM Transactions on Computation Theory. Roč. 15, 1-2 (2023), č. článku 2. ISSN 1942-3454
Institutional support: RVO:67985840
Keywords : circuit complexity * communication complexity * proof complexity
OECD category: Pure mathematics
Impact factor: 0.7, year: 2022
Method of publishing: Limited access
https://doi.org/10.1145/3583754
Permanent Link: https://hdl.handle.net/11104/0344548File Download Size Commentary Version Access Folwarczny1.pdf 1 492.8 KB Publisher’s postprint require - 2.0546785 - MÚ 2022 RIV US eng J - Journal Article
Gavinsky, Dmitry
The Layer complexity of Arthur-Merlin-like communication.
Theory of Computing. Roč. 17, č. 1 (2021), č. článku 8. ISSN 1557-2862. E-ISSN 1557-2862
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : communication complexity * complexity classes
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.816, year: 2021
Method of publishing: Open access
http://dx.doi.org/10.4086/toc.2021.v017a008
Permanent Link: http://hdl.handle.net/11104/0323166File Download Size Commentary Version Access Gavinsky1.pdf 2 321.6 KB Publisher’s postprint open-access - 3.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 - 4.0539558 - MÚ 2021 RIV US eng C - Conference Paper (international conference)
de Rezende, Susanna F. - Meir, O. - Norström, J. - Pitassi, T. - Robere, R. - Vinyals, M.
Lifting with simple gadgets and applications to circuit and proof complexity.
2020 IEEE 61st Annual Symposium on Foundations of Computer Science. Los Alamitos: IEEE, 2020, s. 24-30. ISBN 978-1-7281-9622-0.
[61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. Durham (US), 16.11.2020-19.11.2020]
Institutional support: RVO:67985840
Keywords : circuit complexity * communication complexity * cutting planes
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.1109/FOCS46700.2020.00011
Permanent Link: http://hdl.handle.net/11104/0317277File Download Size Commentary Version Access deRezende2.pdf 0 209.6 KB Publisher’s postprint require - 5.0539556 - MÚ 2021 RIV US eng C - Conference Paper (international conference)
de Rezende, Susanna F. - Meir, O. - Norström, J. - Pitassi, T. - Robere, R.
Krw composition theorems via lifting.
2020 IEEE 61st Annual Symposium on Foundations of Computer Science. Los Alamitos: IEEE, 2020, s. 43-49. ISBN 978-1-7281-9622-0.
[61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. Durham (US), 16.11.2020-19.11.2020]
Institutional support: RVO:67985840
Keywords : circuit complexity * circuit lower bounds * communication complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.1109/FOCS46700.2020.00013
Permanent Link: http://hdl.handle.net/11104/0317276File Download Size Commentary Version Access deRezende1.pdf 0 223.9 KB Publisher’s postprint require - 6.0532192 - MÚ 2021 RIV US eng J - Journal Article
Gavinsky, Dmitry
The communication complexity of the inevitable intersection problem.
Chicago Journal of Theoretical Computer Science. Roč. 2020, April (2020), č. článku 3. ISSN 1073-0486
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : communication complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Method of publishing: Open access
https://doi.org/10.4086/cjtcs.2020.003
Permanent Link: http://hdl.handle.net/11104/0310771File Download Size Commentary Version Access Gavinsky3.pdf 2 350.2 KB Publisher’s postprint open-access - 7.0525502 - MÚ 2021 RIV US eng J - Journal Article
Gavinsky, Dmitry
Entangled simultaneity versus classical interactivity in communication complexity.
IEEE Transactions on Information Theory. Roč. 66, č. 7 (2020), s. 4641-4651. ISSN 0018-9448. E-ISSN 1557-9654
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : communication complexity * quantum communication * quantum computing
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 2.501, year: 2020
Method of publishing: Limited access
http://dx.doi.org/10.1109/TIT.2020.2976074
Permanent Link: http://hdl.handle.net/11104/0309618File Download Size Commentary Version Access Gavinsky1.pdf 2 450.9 KB Publisher’s postprint require - 8.0525399 - MÚ 2021 RIV US eng C - Conference Paper (international conference)
Gavinsky, Dmitry
Bare quantum simultaneity versus classical interactivity in communication complexity.
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. New York: Association for Computing Machinery, 2020 - (Makarychev, K.; Makarychev, Y.; Tulsiani, M.; Kamath, G.; Chuzhoy, J.), s. 401-411. ISBN 978-1-4503-6979-4.
[52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020). Chicago (US), 22.06.2020-26.06.2020]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : quantum communication complexity * communication complexity models
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.1145/3357713.3384243
Permanent Link: http://hdl.handle.net/11104/0309548File Download Size Commentary Version Access Gavinsky.pdf 2 902.8 KB Publisher’s postprint open-access - 9.0509379 - MÚ 2020 RIV US eng J - Journal Article
Gavinsky, Dmitry
Quantum versus classical simultaneity in communication complexity.
IEEE Transactions on Information Theory. Roč. 65, č. 10 (2019), s. 6466-6483. ISSN 0018-9448. E-ISSN 1557-9654
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : communication complexity * quantum communication * quantum computing
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 3.036, year: 2019
Method of publishing: Limited access
http://dx.doi.org/10.1109/TIT.2019.2918453
Permanent Link: http://hdl.handle.net/11104/0300144File Download Size Commentary Version Access Gavinsky1.pdf 7 336.2 KB Publisher’s postprint require - 10.0473687 - MÚ 2018 RIV US eng J - Journal Article
Gavinsky, Dmitry - Pudlák, Pavel
Partition expanders.
Theory of Computing Systems. Roč. 60, č. 3 (2017), s. 378-395. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : expanders * pseudorandomness * communication complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 0.458, year: 2017
http://link.springer.com/article/10.1007%2Fs00224-016-9738-5
Permanent Link: http://hdl.handle.net/11104/0270815File Download Size Commentary Version Access Pudlak.pdf 2 284.9 KB Publisher’s postprint require