Simulating circuit-level simplifications on CNF (Q352967): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6184687 / rank
 
Normal rank
Property / zbMATH Keywords
 
Boolean satisfiability
Property / zbMATH Keywords: Boolean satisfiability / rank
 
Normal rank
Property / zbMATH Keywords
 
preprocessing
Property / zbMATH Keywords: preprocessing / rank
 
Normal rank
Property / zbMATH Keywords
 
problem structure
Property / zbMATH Keywords: problem structure / rank
 
Normal rank
Property / zbMATH Keywords
 
blocked clauses
Property / zbMATH Keywords: blocked clauses / rank
 
Normal rank
Property / zbMATH Keywords
 
variable elimination
Property / zbMATH Keywords: variable elimination / rank
 
Normal rank
Property / zbMATH Keywords
 
Boolean circuits
Property / zbMATH Keywords: Boolean circuits / rank
 
Normal rank

Revision as of 08:49, 28 June 2023

scientific article
Language Label Description Also known as
English
Simulating circuit-level simplifications on CNF
scientific article

    Statements

    Simulating circuit-level simplifications on CNF (English)
    0 references
    0 references
    0 references
    0 references
    5 July 2013
    0 references
    Boolean satisfiability
    0 references
    preprocessing
    0 references
    problem structure
    0 references
    blocked clauses
    0 references
    variable elimination
    0 references
    Boolean circuits
    0 references

    Identifiers