%0 Conference Paper %1 conf/cav/BendikM20 %A Bendík, Jaroslav %A Meel, Kuldeep S. %B CAV (1) %D 2020 %E Lahiri, Shuvendu K. %E Wang, Chao %I Springer %K dblp %P 439-462 %T Approximate Counting of Minimal Unsatisfiable Subsets. %U http://dblp.uni-trier.de/db/conf/cav/cav2020-1.html#BendikM20 %V 12224 %@ 978-3-030-53288-8

@inproceedings{conf/cav/BendikM20, added-at = {2020-08-12T00:00:00.000+0200}, author = {Bendík, Jaroslav and Meel, Kuldeep S.}, biburl = {https://www.bibsonomy.org/bibtex/2af9e489de0f6ed7af2b3990dc9df4732/dblp}, booktitle = {CAV (1)}, crossref = {conf/cav/2020-1}, editor = {Lahiri, Shuvendu K. and Wang, Chao}, ee = {https://doi.org/10.1007/978-3-030-53288-8_21}, interhash = {be10a360d68bd8adc7f2a404d4741cca}, intrahash = {af9e489de0f6ed7af2b3990dc9df4732}, isbn = {978-3-030-53288-8}, keywords = {dblp}, pages = {439-462}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-08-13T11:55:03.000+0200}, title = {Approximate Counting of Minimal Unsatisfiable Subsets.}, url = {http://dblp.uni-trier.de/db/conf/cav/cav2020-1.html#BendikM20}, volume = 12224, year = 2020 }