Binary package “ratpoints” in ubuntu noble
find rational points on hyperelliptic curves
This program tries to find all rational points within a given height
bound on a hyperelliptic curve in a very efficient way, by using
an optimized quadratic sieve algorithm.
Source package
Published versions
- ratpoints 1:2.1.3-2 in amd64 (Release)
- ratpoints 1:2.1.3-2build1 in amd64 (Proposed)
- ratpoints 1:2.1.3-2build1 in amd64 (Release)
- ratpoints 1:2.1.3-2 in arm64 (Release)
- ratpoints 1:2.1.3-2build1 in arm64 (Proposed)
- ratpoints 1:2.1.3-2build1 in arm64 (Release)
- ratpoints 1:2.1.3-2 in armhf (Release)
- ratpoints 1:2.1.3-2build1 in armhf (Proposed)
- ratpoints 1:2.1.3-2build1 in armhf (Release)
- ratpoints 1:2.1.3-2 in ppc64el (Release)
- ratpoints 1:2.1.3-2build1 in ppc64el (Proposed)
- ratpoints 1:2.1.3-2build1 in ppc64el (Release)
- ratpoints 1:2.1.3-2 in riscv64 (Release)
- ratpoints 1:2.1.3-2build1 in riscv64 (Proposed)
- ratpoints 1:2.1.3-2build1 in riscv64 (Release)
- ratpoints 1:2.1.3-2 in s390x (Release)
- ratpoints 1:2.1.3-2build1 in s390x (Proposed)
- ratpoints 1:2.1.3-2build1 in s390x (Release)