default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal on Satisfiability, Boolean Modeling and Computation, Volume 10
Volume 10, Number 1, 2016
- Mikolas Janota:
On Exponential Lower Bounds for Partially Ordered Resolution. 1-9 - Srinivasan Arunachalam, Ilias S. Kotsireas:
Hard satisfiable 3-SAT instances via autocorrelation. 11-22 - Sam Buss, Jan Johannsen:
On Linear Resolution. 23-35 - Patrick Scharpfenecker
, Jacobo Torán:
Solution-Graphs of Boolean Formulas and Isomorphism. 37-58
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.
last updated on 2025-11-29 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
