Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. L. Adleman, Two theorems on random polynomial time, Proceedings of the 19th IEEE Symposium on Foundations of Comp. Science, 1978, pp. 75–83.
2. Arithmetization: a new method in structural complexity theory;Babai;Comp. Compl.,1991
3. L. Blum, F. Cucker, M. Shub, S. Smale, Algebraic Settings for the Problem “P≠ NP?”, The Mathematics of Numerical Analysis, No. 32, Lectures in Applied Mathematics, American Mathematical Society, Providence, RI, pp. 125–144.
4. On a theory of computation and complexity over the real numbers;Blum;Bull. Amer. Math. Soc.,1989
5. P. Bürgisser, Completeness and Reduction in Algebraic Complexity Theory, Habilitationsschrift Universität Zürich, Algorithms and Computation in Mathematics, Vol. 7, Springer, Berlin, to appear.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献