Key | Value |
---|---|
FileName | ./usr/include/picosat/picosat.h |
FileSize | 28293 |
MD5 | F684208BC50D016E0393EA2D4E7696F6 |
SHA-1 | 7792DCC7ED455D76A7341D6D1FA720D82773FDED |
SHA-256 | 965F8A8043328D3C3A973F8DA14FFC6AF0423A6609931D261BFB97B9A4F98C6B |
SSDEEP | 384:B6WVHtqpqy0FU8P6CAym9s78T/4wyjjjQB0b6OtP909GqGI6wHZE+:AIGV02Xo20wE6OtP909GqznHZj |
TLSH | T192D27113AD452F3B4783E67047DD61E5D338D118726268E5B8BF528CAF8A891423FEE4 |
hashlookup:parent-total | 18 |
hashlookup:trust | 100 |
The searched file hash is included in 18 parent files which include package known and seen by metalookup. A sample is included below:
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 | 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 | 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 | 148766 |
MD5 | 850952FA71CA71B925EBF905629590AE |
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 | 6562E6278DA38B5F7CFC49ACC602F26B1F898254 |
SHA-256 | 7D97A74062B3FABDAB0A72FF940740EAB6875E797649D3B03B0BA424CD2A9C34 |
Key | Value |
---|---|
FileSize | 114238 |
MD5 | B3EAA7226FB5B8E58B80ACCEC7C7100F |
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 | 83D02774C62CEA75DB1F21F926287DE597D43D0C |
SHA-256 | 044C89A9B52B73552ED824D221CA7EFA65EEA8B7C7DED828721285A1FA0EFEEF |
Key | Value |
---|---|
FileSize | 105404 |
MD5 | 1CEB2B8FE09D9452012D059746C3020B |
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 | 9A1FEA4C7F0782E614C9BB55C4DCD2486B477502 |
SHA-256 | A33716C5F2D40A100C46F188B8454ED6F4ECE2DFE8298A6764795B91A4D3CA99 |
Key | Value |
---|---|
FileSize | 122050 |
MD5 | 458999DADA3E5920A7541C4FB1CE8539 |
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-1 |
SHA-1 | 9AC3BF5F844DCA194F667528F63F682E7F27B8D9 |
SHA-256 | 9F6C5E313522A3FCA97E5E2F76C99E6FA047A578939EACC83A74940C04E33753 |
Key | Value |
---|---|
FileSize | 122672 |
MD5 | C9D4FF2878F5045721D0819B8FECABD8 |
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 | A9802E3F06C0B3EE41361A3854355FFD4060BDEC |
SHA-256 | A2D7346F6E95465C2DD4A872B52928E5385F9E4054330CC009041494800F64FD |