On WLCDs and the complexity of word-level decision diagrams --- A lower bound for division

DOI10.1023/A:1014702331828zbMath1017.68068OpenAlexW1596974888MaRDI QIDQ1600657

Thomas Weis, Christoph Scholl, Bernd Becker

Publication date: 16 June 2002

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014702331828

zbMATH Keywords

decision diagramsword-level linear combination diagrams

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

GenMul: Generating Architecturally Complex Multipliers to Challenge Formal Verification Tools

This page was built for publication: On WLCDs and the complexity of word-level decision diagrams --- A lower bound for division