Hash-based preprocessing and inprocessing techniques in SAT solvers (Q2118288): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3173795160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keyed hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause Elimination Procedures for CNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inprocessing Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of SAT Solvers to Cryptanalysis of Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3194805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 09:50, 28 July 2024

scientific article
Language Label Description Also known as
English
Hash-based preprocessing and inprocessing techniques in SAT solvers
scientific article

    Statements

    Hash-based preprocessing and inprocessing techniques in SAT solvers (English)
    0 references
    0 references
    22 March 2022
    0 references
    SAT
    0 references
    CDCL
    0 references
    preprocessing
    0 references
    inprocessing
    0 references
    hash
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references