Constrained Sampling and Counting: Universal Hashing Meets SAT Solving - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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. In Adnan Darwiche, editor, Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016. Volume WS-16-05 of AAAI Workshops, AAAI Press, 2016. [doi]

This author has not been identified. Look up 'Kuldeep S. Meel' in GoogleThis author has not been identified. Look up 'Moshe Y. Vardi' in GoogleThis author has not been identified. Look up 'Supratik Chakraborty' in GoogleThis author has not been identified. Look up 'Daniel J. Fremont' in GoogleThis author has not been identified. Look up 'Sanjit A. Seshia' in GoogleThis author has not been identified. Look up 'Dror Fried' in GoogleThis author has not been identified. Look up 'Alexander Ivrii' in GoogleThis author has not been identified. Look up 'Sharad Malik' in Google

runs on WebDSL