Search results
- 1.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 - 2.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 - 3.0336087 - MÚ 2010 RIV US eng C - Conference Paper (international conference)
Hansen, K.A. - Koucký, Michal - Miltersen, P.B.
Winning concurrent reachability games requires doubly-exponential patience.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LISC 2009. Los Angeles: IEEE Computer Society, 2009, s. 332-341. ISBN 978-0-7695-3746-7. ISSN 1043-6871.
[24th Annual IEEE Symposium on Logic in Computer Science. Los Angeles (US), 11.08.2009-14.08.2009]
R&D Projects: GA ČR GP201/07/P276; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : concurrent reachability game * patience * winning strategies
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0180404File Download Size Commentary Version Access Koucky1.pdf 1 284 KB Publisher’s postprint require