"Constrained Sampling and Counting: Universal Hashing Meets SAT Solving."

Kuldeep S. Meel et al. (2016)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition @ aaai.org (archived)
- export record
  dblp key:
  - conf/aaai/MeelVCFSFIM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/MeelVCFSFIM16
Kuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik:
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. AAAI Workshop: Beyond NP 2016

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.