ratpoints 1:2.1.3-2build1 source package in Ubuntu

Changelog

ratpoints (1:2.1.3-2build1) noble; urgency=high

  * No change rebuild against frame pointers and time_t.

 -- Julian Andres Klode <email address hidden>  Mon, 22 Apr 2024 11:50:32 +0200

Upload details

Uploaded by:
Julian Andres Klode
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
misc
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc
Noble release universe misc

Downloads

File Size SHA-256 Checksum
ratpoints_2.1.3.orig.tar.gz 202.8 KiB c4bd55b4fe6234ed4793edfb6126f63b13ee2eaf122f3dfd8f4737a7096a0a7e
ratpoints_2.1.3-2build1.debian.tar.xz 16.9 KiB 9231ee0b89d5317c1989497994b0baeef4800c9d729e4dd23f3a738c8ba4c521
ratpoints_2.1.3-2build1.dsc 2.2 KiB c0af8cf79aa0162d607c556731cb8a1e9643e71d6ba8403f88811a9e8b2ba6a1

View changes file

Binary packages built by this source

libratpoints-2.1.3: library for finding 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.
 .
 This package contains the shared library.

libratpoints-2.1.3-dbgsym: debug symbols for libratpoints-2.1.3
libratpoints-dev: development files for libratpoints

 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.
 .
 This package contains the development files for the library.

ratpoints: 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.

ratpoints-dbgsym: debug symbols for ratpoints