"Hashing-based approximate counting of minimal unsatisfiable subsets."

Jaroslav Bendík, Kuldeep S. Meel (2024)

> Home

Details and statistics

DOI: 10.1007/S10703-023-00419-W

access: closed

type: Journal Article

metadata version: 2024-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fmsd/BendikM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fmsd/BendikM24
Jaroslav Bendík, Kuldeep S. Meel:
Hashing-based approximate counting of minimal unsatisfiable subsets. Formal Methods Syst. Des. 63(1): 5-39 (2024)

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.