Number of the records: 1
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
- 1.
SYSNO 0352607 Title The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory Author(s) Allender, E. (US)
Koucký, Michal (MU-W) RID, SAI, ORCID
Ronneburger, D. (US)
Roy, S. (IN)Source Title Journal of Computer and System Sciences. Roč. 77, č. 1 (2011), s. 14-40. - : Elsevier Document Type Článek v odborném periodiku Grant GAP202/10/0854 GA ČR - Czech Science Foundation (CSF) 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) CEZ AV0Z10190503 - MU-W (2005-2011) Language eng Country US Keywords Circuit complexity * Distinguishing complexity * FewEXP * Formula size * Kolmogorov complexity URL http://www.sciencedirect.com/science/article/pii/S0022000010000887 Permanent Link http://hdl.handle.net/11104/0192081 File Download Size Commentary Version Access Koucky.pdf 1 404.2 KB Publisher’s postprint require
Number of the records: 1