| 1 |
Source: ratpoints |
| 2 |
Maintainer: Debian Science Maintainers <[email protected]> |
| 3 |
Uploaders: Tobias Hansen <[email protected]> |
| 4 |
Section: libs |
| 5 |
Priority: optional |
| 6 |
Build-Depends: debhelper-compat (= 13), |
| 7 |
libgmp-dev |
| 8 |
Standards-Version: 4.6.0 |
| 9 |
Vcs-Browser: https://salsa.debian.org/science-team/ratpoints |
| 10 |
Vcs-Git: https://salsa.debian.org/science-team/ratpoints.git |
| 11 |
Homepage: https://www.mathe2.uni-bayreuth.de/stoll/programs/ |
| 12 |
Rules-Requires-Root: no |
| 13 |
|
| 14 |
Package: ratpoints |
| 15 |
Architecture: any |
| 16 |
Depends: ${shlibs:Depends}, |
| 17 |
${misc:Depends} |
| 18 |
Description: find rational points on hyperelliptic curves |
| 19 |
This program tries to find all rational points within a given height |
| 20 |
bound on a hyperelliptic curve in a very efficient way, by using |
| 21 |
an optimized quadratic sieve algorithm. |
| 22 |
|
| 23 |
Package: libratpoints-dev |
| 24 |
Architecture: any |
| 25 |
Section: libdevel |
| 26 |
Depends: ${misc:Depends}, |
| 27 |
libratpoints-2.1.3 (= ${binary:Version}) |
| 28 |
Multi-Arch: same |
| 29 |
Description: development files for libratpoints |
| 30 |
This program tries to find all rational points within a given height |
| 31 |
bound on a hyperelliptic curve in a very efficient way, by using |
| 32 |
an optimized quadratic sieve algorithm. |
| 33 |
. |
| 34 |
This package contains the development files for the library. |
| 35 |
|
| 36 |
Package: libratpoints-2.1.3 |
| 37 |
Architecture: any |
| 38 |
Multi-Arch: same |
| 39 |
Depends: ${shlibs:Depends}, |
| 40 |
${misc:Depends} |
| 41 |
Pre-Depends: ${misc:Pre-Depends} |
| 42 |
Description: library for finding rational points on hyperelliptic curves |
| 43 |
This program tries to find all rational points within a given height |
| 44 |
bound on a hyperelliptic curve in a very efficient way, by using |
| 45 |
an optimized quadratic sieve algorithm. |
| 46 |
. |
| 47 |
This package contains the shared library. |