Author:
Schröder Matthias,Steinberg Florian,Ziegler Martin
Publisher
Springer International Publishing
Reference16 articles.
1. Brattka, V., Hölzl, R., Gherardi, G.: Probabilistic computability and choice. Inf. Comput. 242(C), 249–286 (2015)
2. Bosserhoff, V.: Notions of probabilistic computability on represented spaces. J. Univ. Comput. Sci. 146(6), 956–995 (2008)
3. Bogdanov, A., Trevisan, L.: Average-case complexity. Found. Trends Theor. Comput. Sci. 2(1), 1–106 (2006).
arXiv:cs/0606037
4. Coja-Oghlan, A., Krivelevich, M., Vilenchik, D.: Why almost all
$$k$$
-colorable graphs are easy to color. Theor. Comput. Syst. 46(3), 523–565 (2010)
5. Lecture Notes in Computer Science;O Goldreich,2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Software Testing in Computable Analysis;Lecture Notes in Computer Science;2024