Search results
- 1.0422134 - MÚ 2014 RIV US eng J - Journal Article
Gál, A. - Hansen, A. K. - Koucký, Michal - Pudlák, Pavel - Viola, E.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
IEEE Transactions on Information Theory. Roč. 59, č. 10 (2013), s. 6611-6627. ISSN 0018-9448. E-ISSN 1557-9654
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : bounded-depth circuits * error-correcting codes * hashing
Subject RIV: BA - General Mathematics
Impact factor: 2.650, year: 2013
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6578188
Permanent Link: http://hdl.handle.net/11104/0228346File Download Size Commentary Version Access Koucky.pdf 17 4.5 MB Publisher’s postprint require - 2.0386309 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Gál, A. - Hansen, K.A. - Koucký, Michal - Pudlák, Pavel - Viola, E.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
Proceedings of the 44th Symposium on Theory of Computing, STOC'2012. New York: ACM, 2012 - (Karloff, H.; Pitassi, T.), s. 479-494. 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 GBP202/12/G061; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional support: RVO:67985840
Keywords : error correcting codes * bounded depth circuits * superconcentrators
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?id=2213977.2214023&coll=DL&dl=GUIDE&CFID=245194486&CFTOKEN=14126751
Permanent Link: http://hdl.handle.net/11104/0219390File Download Size Commentary Version Access Koucky3.pdf 1 287.1 KB Author’s postprint require - 3.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 - 4.0337059 - MÚ 2010 RIV DE eng J - Journal Article
Kolodziejczyk, L. A. - Thapen, Neil
The polynomial and linear time hierarchies in V-0.
[Polynomiální a lineární hierarchie ve V-0.]
Mathematical Logic Quarterly. Roč. 55, č. 5 (2009), s. 509-514. ISSN 0942-5616. E-ISSN 1521-3870
R&D Projects: GA MŠMT LC505
Institutional research plan: CEZ:AV0Z10190503
Keywords : Prefix parity * linear hierarchy * bounded arithmetic * bounded depth circuits
Subject RIV: BA - General Mathematics
Impact factor: 0.523, year: 2009
Permanent Link: http://hdl.handle.net/11104/0181147File Download Size Commentary Version Access Thapen.pdf 1 208.2 KB Publisher’s postprint require - 5.0336102 - MÚ 2010 RIV US eng C - Conference Paper (international conference)
Hansen, K.A. - Koucký, Michal
A new characterization of ACC(0) and probabilistic CC0.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity. Los Alamitos: IEEE Computer Society, 2009, s. 27-34. ISBN 978-0-7695-3717-7. ISSN 1093-0159.
[24th Annual IEEE Conference on Computational Complexity. Paris (FR), 15.07.2009-18.07.2009]
R&D Projects: GA ČR GP201/07/P276; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : bounded depth circuits * counting circuits
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0180415File Download Size Commentary Version Access Koucky.pdf 1 343.6 KB Publisher’s postprint require