"SAT can Ensure Polynomial Bounds for the Verification of Circuits with ..."

Luca Müller, Rolf Drechsler (2024)

> Home

Details and statistics

DOI: 10.1109/DSD64264.2024.00017

access: closed

type: Conference or Workshop Paper

metadata version: 2025-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dsd/MullerD24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dsd/MullerD24
Luca Müller, Rolf Drechsler:
SAT can Ensure Polynomial Bounds for the Verification of Circuits with Limited Cutwidth. DSD 2024: 57-64

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.