Efficient verification of Tunnell's criterion

DOI10.1007/BF03167537zbMath1183.11015MaRDI QIDQ957686

Nathan C. Ryan, Eric Bach

Publication date: 1 December 2008

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityquadratic formscongruent numbers

Mathematics Subject Classification ID

Sums of squares and representations by other particular quadratic forms (11E25) Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16) Counting solutions of Diophantine equations (11D45) Cubic and quartic Diophantine equations (11D25)

Related Items (1)

A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM

Uses Software

• NTL

Cites Work

• A classical Diophantine problem and modular forms of weight \(3/2\)
• The complexity of combinatorial problems with succinct input representation
• Lattice points on ellipses
• An improved Monte Carlo factorization algorithm
• Asymptotically Fast Factorization of Integers
• The Jacobi symbol algorithm
• Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient verification of Tunnell's criterion