SAT can Ensure Polynomial Bounds for the Verification of Circuits with Limited Cutwidth

@inproceedings{pub15214,
    author = {

Müller, Luca
 and 

Drechsler, Rolf
},
    title = {SAT can Ensure Polynomial Bounds for the Verification of Circuits with Limited Cutwidth},
    booktitle = {16th International Workshop on Boolean Problems (IWSBP). International Workshop on Boolean Problems (IWSBP-2024), September 19-20, Bremen, Germany},
    year = {2024}
}