%0 Conference Paper %1 conf/jelia/ArecesCCFS23 %A Areces, Carlos %A Cassano, Valentin %A Castro, Pablo F. %A Fervari, Raul %A Saravia, Andrés R. %B JELIA %D 2023 %E Gaggl, Sarah Alice %E Martinez, Maria Vanina %E Ortiz, Magdalena %I Springer %K dblp %P 405-419 %T How Easy it is to Know How: An Upper Bound for the Satisfiability Problem. %U http://dblp.uni-trier.de/db/conf/jelia/jelia2023.html#ArecesCCFS23 %V 14281 %@ 978-3-031-43619-2

@inproceedings{conf/jelia/ArecesCCFS23, added-at = {2023-09-28T00:00:00.000+0200}, author = {Areces, Carlos and Cassano, Valentin and Castro, Pablo F. and Fervari, Raul and Saravia, Andrés R.}, biburl = {https://www.bibsonomy.org/bibtex/21c42b2349b2bd999556286fcf5d6aec2/dblp}, booktitle = {JELIA}, crossref = {conf/jelia/2023}, editor = {Gaggl, Sarah Alice and Martinez, Maria Vanina and Ortiz, Magdalena}, ee = {https://doi.org/10.1007/978-3-031-43619-2_28}, interhash = {ab728f53c767d4489ff27db866b2f431}, intrahash = {1c42b2349b2bd999556286fcf5d6aec2}, isbn = {978-3-031-43619-2}, keywords = {dblp}, pages = {405-419}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T22:46:54.000+0200}, title = {How Easy it is to Know How: An Upper Bound for the Satisfiability Problem.}, url = {http://dblp.uni-trier.de/db/conf/jelia/jelia2023.html#ArecesCCFS23}, volume = 14281, year = 2023 }