default search action
Search dblp for Publications
export results for "toc:db/journals/jsat/jsat15.bht:"
@article{DBLP:journals/jsat/BeyersdorffCDM24, author = {Olaf Beyersdorff and Judith Clymo and Stefan S. Dantchev and Barnaby Martin}, title = {The Riis Complexity Gap for {QBF} Resolution}, journal = {J. Satisf. Boolean Model. Comput.}, volume = {15}, number = {1}, pages = {9--25}, year = {2024}, url = {https://doi.org/10.3233/sat-231505}, doi = {10.3233/SAT-231505}, timestamp = {Tue, 26 Nov 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsat/BeyersdorffCDM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsat/BeyersdorffHS24, author = {Olaf Beyersdorff and Tim Hoffmann and Luc Nicolas Spachmann}, title = {Proof Complexity of Propositional Model Counting}, journal = {J. Satisf. Boolean Model. Comput.}, volume = {15}, number = {1}, pages = {27--59}, year = {2024}, url = {https://doi.org/10.3233/sat-231507}, doi = {10.3233/SAT-231507}, timestamp = {Tue, 26 Nov 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsat/BeyersdorffHS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsat/Nadel24, author = {Alexander Nadel}, title = {TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver}, journal = {J. Satisf. Boolean Model. Comput.}, volume = {15}, number = {1}, pages = {1--7}, year = {2024}, url = {https://doi.org/10.3233/sat-231504}, doi = {10.3233/SAT-231504}, timestamp = {Tue, 26 Nov 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsat/Nadel24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.