Result for 240EA9AD7F4BFA9FB5B4BD3A00BE44F58BA9BE68

Search result
Graph view
Parent (11)

Query result

Key Value
FileNameREADME.txt.gz
FileSize5032
MD5F272159ADE4A33965F83F38015A98EA1
RDS:package_id263765
SHA-1240EA9AD7F4BFA9FB5B4BD3A00BE44F58BA9BE68
SHA-256997FCFB83177A99161765685D73010E7DFB50622C89AC2D5DCB4A2B6C409615C
SSDEEP96:bO0L5//cvQW/T+6I2k+pf5U2Am6vDTPWBhGJZz:bd1q/R/5U2AmiDrz
TLSHT1AAA18E98F087A2F27F419E2E730D23C6D10B1EB45765C5F0C3726591D963DA9160D35C
insert-timestamp1654977300.3390946
sourcemodern.db
hashlookup:parent-total11
hashlookup:trust100

Network graph view

Parents (Total: 11)

The searched file hash is included in 11 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize36144
MD52EE05E6BDB2D36F4F6B9DAC8B407D1AB
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-14257098146D4CF3B1E9CD07D841759D7D47FABC6
SHA-2562EF86518D84EDADB9FB4DD132A9FDEA08EE391989D1448079FDF82BBBE38903F
Key Value
FileSize1846520
MD5D202028B581D40D986C6DAD3294B8695
PackageDescriptionlibraries for sparse matrices computations (documentation) Suitesparse is a collection of libraries for computations involving sparse matrices. This package contains the user guides for the libraries distributed by the SuiteSparse project.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuitesparse-doc
PackageSectiondoc
PackageVersion1:4.5.4-1
SHA-11AC4668EBE9A5FD305DF650D964E242EDBEE3090
SHA-2568705D270E699C98AEC45602799CD965F3C5559CAB8DEA969F1D4C62190A03535
Key Value
FileSize31118
MD5E31A81172E05F62E72229742EDA732C5
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-1C878F39ABFEE8B9F86C674DE6C3392C02D320AEE
SHA-256787425FE3E0218F15AE44DF279C240C6E299FF3C060209CD4AAC9DCD0CA84C33
Key Value
FileSize35544
MD5B91FAB65E7EB07FE195EC8CD9D9EEDDF
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-1EF69137F1BB7F888CDD5738A7BCB3537FBCD03DD
SHA-256922FF256E4BC92AB6144927E3648A355033456D06B62E18026AD75B9E37A64B9
Key Value
FileSize32302
MD58A00FA753999B76154AFF980284B82B0
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-1606EFA3E61C7B9B013F4C56506CE129714E060AC
SHA-2563E630A0914282BD1CBA237EC25658A7D3676846D6E8CE4FC2CDAF48AA8096B3D
Key Value
FileSize30982
MD5E05706B9755731F8D577DB8F741EE0C2
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-1F2B72CACAED4262DB188040833BF28E4262856B0
SHA-256BB778426F4CE55A3523617C8F849A0B7C4C85ED9D870AFE525C7F4081C0C6F59
Key Value
FileSize36810
MD5DF74D2E1E672981B02DCE4E8B4920EA7
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-11FCC414F63DEAFAA068AA5A2E1AECDFEC858CDF0
SHA-256B56E870EB8DCC4454D4EFDD9E865FC5A825A1367FF269A18891026AA1CC13BD1
Key Value
FileSize33740
MD50237D3F2F677939A6B34F1E8D5ED6E4B
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-11E0BB8BEB3016CEAD2498B0643381FABD84909FB
SHA-25684056F621BE2EFACE719CA01D1D7CF42A520A77F1D88F9F89954F384E06A91AD
Key Value
FileSize30112
MD550C37EFB1141D168F8B430A7412B38E2
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-17105C36C66FD8B32329B2D4D10BC79331716DC98
SHA-256DA8F95A386D207A3446B105C92FB2B68AC6710E32FA268A41789D8C36678C2AC
Key Value
FileSize36288
MD54702D123F6DE9338BF0BC8D3E4ACE6A9
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-1114A13D16F237E6B17E6CCCD0EF7BEBED32F74CE
SHA-256C4214AFD1A1EFCC45FF78A75E87B911F19D4F13F78E12627CB4ED5B972FCED6B
Key Value
FileSize31164
MD57846391177605F3153D37C9075224D1B
PackageDescriptionapproximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibamd2
PackageSectionlibs
PackageVersion1:4.5.4-1
SHA-1F9DBBD0BCF76B5BDB131C6B3B4675419A3FD977C
SHA-2568F9343F080C73EC48864094271006C00195282FCA6A1441B04060719A72EBB35





metalookup is a service from miwakeru.com