Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - CPAPER
ID - DBLP:conf/cav/BendikM20
AU - Bendík, Jaroslav
AU - Meel, Kuldeep S.
TI - Approximate Counting of Minimal Unsatisfiable Subsets.
BT - Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part I
SP - 439
EP - 462
PY - 2020//
DO - 10.1007/978-3-030-53288-8_21
UR - https://doi.org/10.1007/978-3-030-53288-8_21
ER -
