Number of the records: 1
Derandomizing from random strings
- 1.0352483 - MÚ 2011 RIV US eng C - Conference Paper (international conference)
Buhrman, H. - Fortnow, L. - Koucký, Michal - Loff, B.
Derandomizing from random strings.
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010. Los Alamitos: IEEE Computer Society 2010, 2010, s. 58-63. ISBN 978-0-7695-4060-3.
[25th Annual IEEE Conference on Computational Complexity, CCC 2010. Cambridge (US), 09.06.2010-12.06.2010]
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : Kolmogorov random strings * reducibility * complexity classes
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5497897
Permanent Link: http://hdl.handle.net/11104/0191982File Download Size Commentary Version Access Koucky1.pdf 1 337.3 KB Publisher’s postprint require
Number of the records: 1