Lairez, Pierre (2016). "A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time". Foundations of Computational Mathematics. to appear (5): 1265–1292. arXiv:1507.05485. doi:10.1007/s10208-016-9319-7. S2CID8333924.
Shub, Michael; Smale, Steve (1995). "On the intractability of Hilbert's Nullstellensatz and an algebraic version of "NP≠P?"". Duke Math. J. 81: 47–54. doi:10.1215/S0012-7094-95-08105-8. Zbl0882.03040.
Lairez, Pierre (2016). "A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time". Foundations of Computational Mathematics. to appear (5): 1265–1292. arXiv:1507.05485. doi:10.1007/s10208-016-9319-7. S2CID8333924.
Shub, Michael; Smale, Stephen (1993). "Complexity of Bézout's theorem. I. Geometric aspects". J. Amer. Math. Soc. 6 (2): 459–501. doi:10.2307/2152805. JSTOR2152805..
Lairez, Pierre (2016). "A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time". Foundations of Computational Mathematics. to appear (5): 1265–1292. arXiv:1507.05485. doi:10.1007/s10208-016-9319-7. S2CID8333924.
Shub, Michael; Smale, Steve (1995). "On the intractability of Hilbert's Nullstellensatz and an algebraic version of "NP≠P?"". Duke Math. J. 81: 47–54. doi:10.1215/S0012-7094-95-08105-8. Zbl0882.03040.
Bürgisser, Peter (2000). Completeness and reduction in algebraic complexity theory. Algorithms and Computation in Mathematics. Vol. 7. Berlin: Springer-Verlag. p. 141. ISBN978-3-540-66752-0. Zbl0948.68082.