| Key | Value |
|---|---|
| FileName | ./usr/share/doc/mpsolve-doc/list_8h.js |
| FileSize | 1190 |
| MD5 | 86501E2012E4DE75C06B3F5B9AD53EBF |
| SHA-1 | 0171D9DE78A2C742FFCEA34CF029B9B68A07EF44 |
| SHA-256 | 520193A32A2D5B3A5470CDEFD4247D615DAF0FA1DFB2E5ABE8154CED0E625805 |
| SSDEEP | 12:Vxe9WRIf9T9WRlJC2m4Ec251aa4z3KE25xl9rK25xl3725xlW/TwV5xl88r+5xlU:2N9TqCJRBW3KcOLwbrS1uDvYI+k8e |
| TLSH | T1E621A7249210986713C6616B15C55997F620C2231B3E7D3527DD5C6D0BBCE5E3AF233B |
| hashlookup:parent-total | 2 |
| hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | CFACFC5CF6EF6E9FC2A0CD3C23D4453F |
| PackageArch | noarch |
| PackageDescription | MPSolve stands for Multiprecision Polynomial SOLVEr. It aims to provide an easy to use universal blackbox for solving polynomials and secular equations. Its features include: - Arbitrary precision approximation. - Guaranteed inclusion radii for the results. - Exploiting of polynomial structures: it can take advantage of sparsity as well as coefficients in a particular domain (i.e. integers or rationals). - It can be specialized for specific classes of polynomials. As an example, the roots of the Mandelbrot polynomial of degree 2,097,151 were computed in about 10 days on a dual Xeon server. This package contains developer documentation for mpsolve. |
| PackageMaintainer | Fedora Project |
| PackageName | mpsolve-doc |
| PackageRelease | 5.fc34 |
| PackageVersion | 3.2.1 |
| SHA-1 | F7861D211056CE978222F87A9F3A95BB9EDE7D13 |
| SHA-256 | 61B480F932FFFF5124E407D9A15153C32DFB36531C926127E2F90AE58B53F3F6 |
| Key | Value |
|---|---|
| MD5 | 136B4C410DACADAAABB6EB0341A11698 |
| PackageArch | noarch |
| PackageDescription | MPSolve stands for Multiprecision Polynomial SOLVEr. It aims to provide an easy to use universal blackbox for solving polynomials and secular equations. Its features include: - Arbitrary precision approximation. - Guaranteed inclusion radii for the results. - Exploiting of polynomial structures: it can take advantage of sparsity as well as coefficients in a particular domain (i.e. integers or rationals). - It can be specialized for specific classes of polynomials. As an example, the roots of the Mandelbrot polynomial of degree 2,097,151 were computed in about 10 days on a dual Xeon server. This package contains developer documentation for mpsolve. |
| PackageMaintainer | Fedora Project |
| PackageName | mpsolve-doc |
| PackageRelease | 3.fc33 |
| PackageVersion | 3.2.1 |
| SHA-1 | 0223C219FDA5FF8CA61AF44FA0FBFAD520C42053 |
| SHA-256 | E580C6882D459118E6431AC670FEBF1C5EAAF5BB8ECD896EAA6E3CBB455BABF7 |