On the complexity of Diophantine geometry in low dimensions Academic Article

abstract

• 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).

authors

• Rojas, Joseph

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

published in

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

start page

• 527

end page

• 536