Simplification in a satisfiability checker for VLSI applications (Q1312163)
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: Simplification in a satisfiability checker for VLSI applications |
scientific article; zbMATH DE number 488236
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simplification in a satisfiability checker for VLSI applications |
scientific article; zbMATH DE number 488236 |
Statements
Simplification in a satisfiability checker for VLSI applications (English)
0 references
19 January 1994
0 references
satisfiability checker
0 references
formal verification of VLSI circuits
0 references
combinational circuit verification
0 references
simplification
0 references
pigeonhole problem
0 references
0.8612686
0 references
0.85767525
0 references
0.8576421
0 references
0.85461456
0 references
0.8545904
0 references
0.85279596
0 references
0.85279435
0 references
0.8517637
0 references
