Key | Value |
---|---|
FileName | ./usr/share/man/man1/picosat.1.gz |
FileSize | 1109 |
MD5 | 4441230E4B5CBB6D54CE5271595F2FEA |
SHA-1 | F1D6CC4EE513C45015C511B57C75D1CCA3EE7CC8 |
SHA-256 | CBF9E8F977CEF317669027A02FEDC3DCD7300254F2D32F75E66EDFF61E46AFDB |
SSDEEP | 24:XeEvQLb2qvQUiHbUu6pq4rTNirDSR47tdNW3zf2BjZwLrnNjqm3Y:Xesqv1sbn4rTYr+Kd22BjqLrN+sY |
TLSH | T11F11E9441C5CA35DF723F4941282A27067EFF993B5F5A013B2F202D583080D9ACE25D6 |
hashlookup:parent-total | 31 |
hashlookup:trust | 100 |
The searched file hash is included in 31 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 93380 |
MD5 | B57E2CB0D2F46B10C968C0EAEEEA11C8 |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 965-1 |
SHA-1 | 10F0932201CA39007DCDFDA69288A9CD03EBAAAE |
SHA-256 | 42FCF9358FBEA06EFF023BFF6D493B2CEAF83121E91A7214CC8ADF51D6EE477E |
Key | Value |
---|---|
FileSize | 99640 |
MD5 | 5DD6E97544679E33C57A8A999D5E7980 |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Michael Tautschnig <mt@debian.org> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 960-1+b2 |
SHA-1 | 13A1706210D72B4F45993B97CF25E50E6675BFD4 |
SHA-256 | 7A3F5E78F2A45D2BC93F94A55E55BD0A4B05EC0EBA04073D434FDDD9D5A48BAA |
Key | Value |
---|---|
FileSize | 98808 |
MD5 | 93311232F6610C4BA32DA4760902426F |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 965-2 |
SHA-1 | 1CA431766F13CA5E19B127588DA6747A8CACF213 |
SHA-256 | EAA2AFC6A8E3C254716B008458B501EFDCC9B1C733A201ED8332AC0733A1B214 |
Key | Value |
---|---|
FileSize | 132754 |
MD5 | A7C138A6A147CC56EF6B087B6E020C0F |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Michael Tautschnig <mt@debian.org> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 960-1+b2 |
SHA-1 | 1FECC8E148D808D11540A31BF807D6CAE77B635B |
SHA-256 | 1DC8B37E71C945CE6533043D34F9A97C9E8B04A98CB0598FFFE974CA49DBB5A9 |
Key | Value |
---|---|
FileSize | 115144 |
MD5 | F0161E0B064D5C55DA04135998A8A8E1 |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 960-1build1 |
SHA-1 | 2806784A3777F8C7318A1232807055348939B41B |
SHA-256 | 34AFC0F3A0BBC7F33E55C4A27A6081189CB3D3E6FBEE868CF8514ACA6E1BF3B6 |
Key | Value |
---|---|
FileSize | 112930 |
MD5 | A2663EF7EB36F669CE18B26FC2BA3FE8 |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Michael Tautschnig <mt@debian.org> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 960-1+b2 |
SHA-1 | 332CCA54D12EE28E2EEF648A6A5F706C021194CF |
SHA-256 | 60FCA7C7481E1DB2D2E1205EC078FA434E36D474062F4BF40AD278989797F0F6 |
Key | Value |
---|---|
FileSize | 342724 |
MD5 | ABBA8A2F486E6CD5F656DC2C5179709E |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 954-1 |
SHA-1 | 39F223E5C58FCB0DEBFCF303AFF64AECF9CC87D5 |
SHA-256 | 6D47A490E7A6C9EB5FEC6C9AFEEFBE1D511ED778D98D8EFE32A9FA4B7EBE64C5 |
Key | Value |
---|---|
FileSize | 86260 |
MD5 | A195FD02EF559505E4D2619FAB72BB04 |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 965-2 |
SHA-1 | 499A0D8743E9FF7EB124C6EB104A1D44812538E6 |
SHA-256 | B05CE8FA5DE70AD1DA5B5A3B18ACEEA86433E6BAAD5E9CAB0C9C2A31FB98920C |
Key | Value |
---|---|
FileSize | 113690 |
MD5 | 51652A4127047680A347DB3E9DC8DB9E |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Michael Tautschnig <mt@debian.org> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 960-1 |
SHA-1 | 5875BB59629D635C5EFF610B32BA59578773E133 |
SHA-256 | 7A78A166474EB7479C9D98C4054361934AB38B96610E872C3E195820D177A06C |
Key | Value |
---|---|
FileSize | 98260 |
MD5 | 643768664D325200EB8801238FAD2A43 |
PackageDescription | SAT solver with proof and core support Despite the NP completeness of the satisfiabilty problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems. . PicoSAT is a SAT solver that turned out to be faster on industrial instances than MiniSAT 2.0 and also can generate proofs and cores in memory. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | picosat |
PackageSection | science |
PackageVersion | 965-2 |
SHA-1 | 5B95C72BF697BD28C7863774DD0BE24541DCAB00 |
SHA-256 | 9DEDD4C36C7DE6382973337B86CAC5E3C1AA993FF63016B4863AB4298D69A953 |