%0 Conference Paper %1 conf/synasc/KusperBBTYB20 %A Kusper, Gábor %A Balla, Tamás %A Biró, Csaba %A Tajti, Tibor %A Yang, Zijian Gyozo %A Baják, Imre %B SYNASC %D 2020 %I IEEE %K dblp %P 84-92 %T Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs. %U http://dblp.uni-trier.de/db/conf/synasc/synasc2020.html#KusperBBTYB20 %@ 978-1-7281-7628-4

@inproceedings{conf/synasc/KusperBBTYB20, added-at = {2021-03-03T00:00:00.000+0100}, author = {Kusper, Gábor and Balla, Tamás and Biró, Csaba and Tajti, Tibor and Yang, Zijian Gyozo and Baják, Imre}, biburl = {https://www.bibsonomy.org/bibtex/29fbb146dac2bf486a95f177762f7fb04/dblp}, booktitle = {SYNASC}, crossref = {conf/synasc/2020}, ee = {https://doi.org/10.1109/SYNASC51798.2020.00024}, interhash = {58809686eda0b4b91098974af224e3c4}, intrahash = {9fbb146dac2bf486a95f177762f7fb04}, isbn = {978-1-7281-7628-4}, keywords = {dblp}, pages = {84-92}, publisher = {IEEE}, timestamp = {2024-04-09T23:42:00.000+0200}, title = {Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs.}, url = {http://dblp.uni-trier.de/db/conf/synasc/synasc2020.html#KusperBBTYB20}, year = 2020 }