Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Banaschewski, B., Bruns, G.: Categorical characterization of the MacNeille completion. Archiv der Mathematik 18(4), 369–377 (1967)
2. Lecture Notes in Computer Science;B. Barak,2001
3. Bonsangue, M.M., van Breugel, F., Rutten, J.J.M.M.: Generalized metric spaces: completion, topology, and power domains via the yoneda embedding. Theor. Comput. Sci. 193(1-2), 1–51 (1998)
4. Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer-Verlag New York, Inc., Secaucus (2010)
5. Goldwasser, S., Kalai, Y.T.: On the impossibility of obfuscation with auxiliary input. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 553–562. IEEE Computer Society, Washington, DC (2005)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献