Search results
- 1.0465743 - MÚ 2017 RIV US eng J - Journal Article
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman’s theorem in interactive information complexity.
Algorithmica. Roč. 76, č. 3 (2016), s. 749-781. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : communication complexity * information complexity * information theory
Subject RIV: BA - General Mathematics
Impact factor: 0.735, year: 2016
http://link.springer.com/article/10.1007%2Fs00453-015-0112-9
Permanent Link: http://hdl.handle.net/11104/0264183File Download Size Commentary Version Access Koucky.pdf 4 630.8 KB Publisher’s postprint require - 2.0352519 - MÚ 2011 RIV US eng J - Journal Article
Buhrman, H. - Fortnow, L. - Koucký, Michal - Rogers, J.D. - Vereshchagin, N.K.
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Theory of Computing Systems. Roč. 46, č. 1 (2010), s. 143-156. ISSN 1432-4350. E-ISSN 1433-0490.
[2nd International Computer Science Symposium in Russia (CSR 2007). Ekaterinburg, 03.09.2007-07.09.2007]
R&D Projects: GA ČR GP201/07/P276; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : one-way functions * polynomial hierarchy * Kolmogorov generic oracles
Subject RIV: BA - General Mathematics
Impact factor: 0.600, year: 2010
http://link.springer.com/article/10.1007%2Fs00224-008-9160-8
Permanent Link: http://hdl.handle.net/11104/0192010File Download Size Commentary Version Access Koucky2.pdf 1 382.5 KB Publisher’s postprint require - 3.0038960 - MÚ 2007 RIV US eng J - Journal Article
Allender, E. - Buhrman, H. - Koucký, Michal - van Melkebeek, D. - Ronneburger, D.
Power from Random Strings.
[Síla náhodných řetízků.]
Siam Journal on Computing. Roč. 35, č. 6 (2006), s. 1467-1493. ISSN 0097-5397. E-ISSN 1095-7111
Institutional research plan: CEZ:AV0Z10190503
Keywords : Kolmogorov complexity * completeness * reductions
Subject RIV: BA - General Mathematics
Impact factor: 1.361, year: 2006
Permanent Link: http://hdl.handle.net/11104/0133162File Download Size Commentary Version Access Koucky.pdf 1 307.6 KB Publisher’s postprint require - 4.0038951 - MÚ 2007 RIV NL eng J - Journal Article
Allender, E. - Buhrman, H. - Koucký, Michal
What can be efficiently reduced to the Kolmogorov-random strings?
[Co se dá efektivně zredukovat na Kolmogorovsky náhodné řetízky?]
Annals of Pure and Applied Logic. Roč. 138, č. 1 (2006), s. 2-19. ISSN 0168-0072. E-ISSN 1873-2461
Institutional research plan: CEZ:AV0Z10190503
Keywords : Kolmogorov complexity * Kolmogorov random strings * completeness
Subject RIV: BA - General Mathematics
Impact factor: 0.582, year: 2006
Permanent Link: http://hdl.handle.net/11104/0133157File Download Size Commentary Version Access Koucky1.pdf 1 274.2 KB Publisher’s postprint require