@article{DBLP:journals/corr/abs-2309-17094,
  author       = {Carlos Areces and
                  Valentin Cassano and
                  Raul Fervari and
                  Pablo F. Castro and
                  Andr{\'{e}}s R. Saravia},
  title        = {How Easy it is to Know How: An Upper Bound for the Satisfiability
                  Problem},
  journal      = {CoRR},
  volume       = {abs/2309.17094},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.17094},
  doi          = {10.48550/ARXIV.2309.17094},
  eprinttype    = {arXiv},
  eprint       = {2309.17094},
  timestamp    = {Tue, 17 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-17094.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"rQAiMEQhLGBdw8GkS","bibbaseid":"areces-cassano-fervari-castro-saravia-howeasyitistoknowhowanupperboundforthesatisfiabilityproblem-2023","author_short":["Areces, C.","Cassano, V.","Fervari, R.","Castro, P. F.","Saravia, A. R."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Carlos"],"propositions":[],"lastnames":["Areces"],"suffixes":[]},{"firstnames":["Valentin"],"propositions":[],"lastnames":["Cassano"],"suffixes":[]},{"firstnames":["Raul"],"propositions":[],"lastnames":["Fervari"],"suffixes":[]},{"firstnames":["Pablo","F."],"propositions":[],"lastnames":["Castro"],"suffixes":[]},{"firstnames":["Andrés","R."],"propositions":[],"lastnames":["Saravia"],"suffixes":[]}],"title":"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem","journal":"CoRR","volume":"abs/2309.17094","year":"2023","url":"https://doi.org/10.48550/arXiv.2309.17094","doi":"10.48550/ARXIV.2309.17094","eprinttype":"arXiv","eprint":"2309.17094","timestamp":"Tue, 17 Oct 2023 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/abs-2309-17094.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-2309-17094,\n author = {Carlos Areces and\n Valentin Cassano and\n Raul Fervari and\n Pablo F. Castro and\n Andr{\\'{e}}s R. Saravia},\n title = {How Easy it is to Know How: An Upper Bound for the Satisfiability\n Problem},\n journal = {CoRR},\n volume = {abs/2309.17094},\n year = {2023},\n url = {https://doi.org/10.48550/arXiv.2309.17094},\n doi = {10.48550/ARXIV.2309.17094},\n eprinttype = {arXiv},\n eprint = {2309.17094},\n timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2309-17094.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Areces, C.","Cassano, V.","Fervari, R.","Castro, P. F.","Saravia, A. R."],"key":"DBLP:journals/corr/abs-2309-17094","id":"DBLP:journals/corr/abs-2309-17094","bibbaseid":"areces-cassano-fervari-castro-saravia-howeasyitistoknowhowanupperboundforthesatisfiabilityproblem-2023","role":"author","urls":{"Paper":"https://doi.org/10.48550/arXiv.2309.17094"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/117/9953.bib","dataSources":["HJM7dqFRHjcZZmjge","CctimS4AgKgzGybH5","MSnnygamX7qXNxsq6"],"keywords":[],"search_terms":["easy","know","upper","bound","satisfiability","problem","areces","cassano","fervari","castro","saravia"],"title":"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem","year":2023}