On the complexity of Diophantine geometry in low dimensions Academic Article uri icon


  • The average-case complexity of some undecidable or open Diophantine problems are considered. Examples problems are realized by PSPACE and the generalized Riemann hypothesis (GRH).

published proceedings

  • Conference Proceedings of the Annual ACM Symposium on Theory of Computing

author list (cited authors)

  • Rojas, J. M.

complete list of authors

  • Rojas, JM

publication date

  • January 1999