"Automating OBDD proofs is NP-hard."

Dmitry Itsykson, Artur Riazanov (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2022.59

access: open

type: Conference or Workshop Paper

metadata version: 2022-09-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/ItsyksonR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/ItsyksonR22
Dmitry Itsykson, Artur Riazanov:
Automating OBDD proofs is NP-hard. MFCS 2022: 59:1-59:15

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.