Key | Value |
---|---|
FileName | ./usr/lib/singular/MOD/gitfan.la |
FileSize | 931 |
MD5 | 0E96A8BFD1B2A84FE4202AECCA45ACEE |
SHA-1 | 03C76B115BC285A7702437485EAF7B5F68D7C99F |
SHA-256 | CC8EAA3B40EBCB76B5ED19039D6687D328D8A31FF88426B5EC2ECA8F58B99891 |
SSDEEP | 12:x64fWgxT/r5WFKMoeLiBsRxIha+AAcUBB7Szf77ixCF31vT3RTZ/9IMCKbDqaAlv:jeSxWKmiORxIY+AAmfvi4FvD2NGDe5/H |
TLSH | T17611143BD7AC423ABAD409455ACE303F4346943C0B560D1441DBA5C7124B8172285F3B |
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 | 6B32899357460919429B92C88A1B6A86 |
PackageArch | x86_64 |
PackageDescription | Singular is a computer algebra system for polynomial computations, with special emphasis on commutative and non-commutative algebra, algebraic geometry, and singularity theory. Its main computational objects are ideals, modules and matrices over a large number of baserings. These include * polynomial rings over various ground fields and some rings (including the integers), * localizations of the above, * a general class of non-commutative algebras (including the exterior algebra and the Weyl algebra), * quotient rings of the above, * tensor products of the above. Singular's core algorithms handle * Gröbner resp. standard bases and free resolutions, * polynomial factorization, * resultants, characteristic sets, and numerical root finding. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | singular |
PackageRelease | bp156.1.6 |
PackageVersion | 4.3.1.p3 |
SHA-1 | 1124DD49786F32579168C073C53B7827C1910900 |
SHA-256 | 0248A53E947FC67726FBA855D3DD07889917FDACCB6C5E0342ECB1CC0EF97BF7 |
Key | Value |
---|---|
MD5 | 388ED1512A269EBEE39A782B43D6A35E |
PackageArch | s390x |
PackageDescription | Singular is a computer algebra system for polynomial computations, with special emphasis on commutative and non-commutative algebra, algebraic geometry, and singularity theory. Its main computational objects are ideals, modules and matrices over a large number of baserings. These include * polynomial rings over various ground fields and some rings (including the integers), * localizations of the above, * a general class of non-commutative algebras (including the exterior algebra and the Weyl algebra), * quotient rings of the above, * tensor products of the above. Singular's core algorithms handle * Gröbner resp. standard bases and free resolutions, * polynomial factorization, * resultants, characteristic sets, and numerical root finding. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | singular |
PackageRelease | bp156.1.6 |
PackageVersion | 4.3.1.p3 |
SHA-1 | 1BD927FB6CF1E7F88140D82CA6776A9A21676568 |
SHA-256 | 0AB4C2AD343FFB832D0587FB125AE125BF27355EEECBF9F6674E79563C98D7FA |