Home
EPiC Series
Kalpa Publications
Preprints
For Authors
For Editors
Author
:
Luca Mueller
Publications
SAT Can Ensure Polynomial Bounds for the Verification of Circuits with Limited Cutwidth
Luca Mueller
and
Rolf Drechsler
EasyChair Preprint 14322
Keyphrases
Arithmetic Circuits
,
Polynomial Formal Verification
,
SAT
,
time complexity
,
verification
.
Copyright © 2012-2024 easychair.org. All rights reserved.
