Number of the records: 1
Derandomizing from random strings
- 1.
SYSNO 0352483 Title Derandomizing from random strings Author(s) Buhrman, H. (NL)
Fortnow, L. (US)
Koucký, Michal (MU-W) RID, SAI, ORCID
Loff, B. (PT)Source Title Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010. S. 58-63. - Los Alamitos : IEEE Computer Society 2010, 2010 Conference 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, 09.06.2010-12.06.2010 Document Type Konferenční příspěvek (zahraniční konf.) Grant GAP202/10/0854 GA ČR - Czech Science Foundation (CSF) IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic CEZ AV0Z10190503 - MU-W (2005-2011) Language eng Country US Keywords Kolmogorov random strings * reducibility * complexity classes URL http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5497897 Permanent Link http://hdl.handle.net/11104/0191982 File Download Size Commentary Version Access Koucky1.pdf 1 337.3 KB Publisher’s postprint require
Number of the records: 1