Author:
Ambos-Spies Klaus,Brandt Ulrike,Ziegler Martin
Publisher
Springer Berlin Heidelberg
Reference40 articles.
1. Agrawal, M.: The Isomorphism Conjecture for
$\mathcal{NP}$
. In: Cooper, S.B., Sorbi, A. (eds.) Computability in Context, pp. 19–48. World Scientific (2009)
2. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Springer (1997)
3. Beyersdorff, O., Köbler, J., Müller, S.: Proof Systems that Take Advice. Proof Systems that Take Advice 209(3), 320–332 (2011)
4. Brattka, V.: Recursive Characterization of Computable Real-Valued Functions and Relations. Theoretical Computer Science 162, 45–77 (1996)
5. Brattka, V.: Computable Invariance. Theoretical Computer Science 210, 3–20 (1999)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computer Science for Continuous Data;Computer Algebra in Scientific Computing;2022
2. COMPUTABLE ANALYSIS AND NOTIONS OF CONTINUITY IN COQ;LOG METH COMPUT SCI;2021
3. Small Complexity Classes for Computable Analysis;Mathematical Foundations of Computer Science 2014;2014
4. Cohesiveness in promise problems;RAIRO - Theoretical Informatics and Applications;2013-10