@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},
    bibsource = {dblp computer science bibliography, https://dblp.org},
    biburl = {https://dblp.org/rec/journals/corr/abs-2309-17094.bib},
    doi = {10.48550/ARXIV.2309.17094},
    eprint = {2309.17094},
    eprinttype = {arXiv},
    journal = {CoRR},
    timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
    title = {How Easy it is to Know How: An Upper Bound for the Satisfiability
Problem},
    url = {https://doi.org/10.48550/arXiv.2309.17094},
    volume = {abs/2309.17094},
    year = {2023}
}

{"_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":[]}],"bibsource":"dblp computer science bibliography, https://dblp.org","biburl":"https://dblp.org/rec/journals/corr/abs-2309-17094.bib","doi":"10.48550/ARXIV.2309.17094","eprint":"2309.17094","eprinttype":"arXiv","journal":"CoRR","timestamp":"Tue, 17 Oct 2023 01:00:00 +0200","title":"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem","url":"https://doi.org/10.48550/arXiv.2309.17094","volume":"abs/2309.17094","year":"2023","bibtex":"@article{DBLP:journals/corr/abs-2309-17094,\n author = {Carlos Areces and\nValentin Cassano and\nRaul Fervari and\nPablo F. Castro and\nAndr{\\'{e}}s R. Saravia},\n bibsource = {dblp computer science bibliography, https://dblp.org},\n biburl = {https://dblp.org/rec/journals/corr/abs-2309-17094.bib},\n doi = {10.48550/ARXIV.2309.17094},\n eprint = {2309.17094},\n eprinttype = {arXiv},\n journal = {CoRR},\n timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},\n title = {How Easy it is to Know How: An Upper Bound for the Satisfiability\nProblem},\n url = {https://doi.org/10.48550/arXiv.2309.17094},\n volume = {abs/2309.17094},\n year = {2023}\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://mfis.dc.exa.unrc.edu.ar/downloads/mfis-pubs.bib","dataSources":["CctimS4AgKgzGybH5","KKtjZs868TWfeLxN2"],"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}