Author:
Bienvenu Laurent,Downey Rod
Funder
Marsden Fund
Agence Nationale de la Recherche
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. What can be efficiently reduced to the Kolmogorov-random strings?;Allender;Ann. Pure Appl. Logic,2006
2. Limits on the computational power of random strings;Allender;Inf. Comput.,2013
3. Lowness for Computational Speed;Bayer,2012
4. Relativizations of the P=?NP question;Baker;SIAM J. Comput.,1975
5. Game-Theoretic Characterizations of Randomness: Unpredictability and Stochasticity;Bienvenu,2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献