Simulating circuit-level simplifications on CNF (Q352967)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simulating circuit-level simplifications on CNF |
scientific article; zbMATH DE number 6184687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulating circuit-level simplifications on CNF |
scientific article; zbMATH DE number 6184687 |
Statements
Simulating circuit-level simplifications on CNF (English)
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
0.906356930732727
0 references
0.7988252639770508
0 references
0.7901303172111511
0 references
0.7838549613952637
0 references
0.7800111174583435
0 references
