Search results
- 1.0430344 - MÚ 2015 RIV US eng J - Journal Article
Ada, A. - Chattopadhyay, S. - Cook, S.A. - Fontes, L. - Koucký, Michal - Pitassi, T.
The hardness of being private.
ACM Transactions on Computation Theory. Roč. 6, č. 1 (2014), s. 1. ISSN 1942-3454
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : approximate privacy * communication complexity * information theory
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=2600088.2567671
Permanent Link: http://hdl.handle.net/11104/0235297File Download Size Commentary Version Access Koucky.pdf 3 191.8 KB Publisher’s postprint require - 2.0352607 - MÚ 2011 RIV US eng J - Journal Article
Allender, E. - Koucký, Michal - Ronneburger, D. - Roy, S.
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory.
Journal of Computer and System Sciences. Roč. 77, č. 1 (2011), s. 14-40. ISSN 0022-0000. E-ISSN 1090-2724
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : Circuit complexity * Distinguishing complexity * FewEXP * Formula size * Kolmogorov complexity
Subject RIV: BA - General Mathematics
Impact factor: 1.157, year: 2011
http://www.sciencedirect.com/science/article/pii/S0022000010000887
Permanent Link: http://hdl.handle.net/11104/0192081File Download Size Commentary Version Access Koucky.pdf 1 404.2 KB Publisher’s postprint require - 3.0352511 - MÚ 2011 RIV US eng J - Journal Article
Allender, E. - Koucký, Michal
Amplifying lower bounds by means of self-reducibility.
Journal of the ACM. Roč. 57, č. 3 (2010), s. 1-36. ISSN 0004-5411. E-ISSN 1557-735X
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : Circuit Complexity * Lower Bounds * Natural Proofs * Self-Reducibility * Time-Space Tradeoffs
Subject RIV: BA - General Mathematics
Impact factor: 3.375, year: 2010
http://dl.acm.org/citation.cfm?doid=1706591.1706594
Permanent Link: http://hdl.handle.net/11104/0192003File Download Size Commentary Version Access Koucky.pdf 1 249.6 KB Author’s postprint require - 4.0352500 - MÚ 2011 RIV CH eng J - Journal Article
Hansen, A. K. - Koucký, Michal
A New Characterization of ACC(0) and Probabilistic CC0.
Computational Complexity. Roč. 19, č. 2 (2010), s. 211-234. ISSN 1016-3328. E-ISSN 1420-8954.
[24th Annual IEEE Conference on Computational Complexity. Paris, 15.07.2009-18.07.2009]
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : bounded depth circuits * counting circuits * arithmetic circuits * complexity classes
Subject RIV: BA - General Mathematics
Impact factor: 1.450, year: 2010
http://link.springer.com/article/10.1007%2Fs00037-010-0287-z
Permanent Link: http://hdl.handle.net/11104/0191994File Download Size Commentary Version Access Koucky3.pdf 1 539.5 KB Publisher’s postprint require