„Boolean satisfiability problem“

Suchergebnisse

1.000+ Treffer

• Efficient solution of Boolean satisfiability problems with digital memcomputing
  Bearden, Sean R. B. ; Pei, Yan Ru ; Di Ventra, Massimiliano
• Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas
  Horiyama, Takashi ; Okura, Yuto ; Seto, Kazuhisa ; Teruyama, Junichi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SAT Encodings of Finite CSPs
  Nguyen, Van-Hau ; Hölldobler, Steffen ; Barahona, Pedro 2015 Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
• SAT-based String Solving – Solving String Constraints by Reduction to Boolean Satisfiability
  Lotz, Kevin ; Nowotka, Dirk ; Manea, Florin Silviu 2025 Universitätsbibliothek Kiel
• DynamicSAT: Dynamic Configuration Tuning for SAT Solving
  Shi, Zhengyuan ; Jiang, Wentao ; Zhang, Xindi ; Luo, Jin ; Liang, Yun ; Chu, Zhufei ; Xu, Qiang 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decision Procedures – An Algorithmic Point of View
  Kroening, Daniel ; Strichman, Ofer 2016 Springer Berlin Heidelberg
• Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
  Künnemann, Marvin ; Marx, Dániel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SAT and Interactions (Dagstuhl Seminar 16381)
  Beyersdorff, Olaf ; Creignou, Nadia ; Egly, Uwe ; Vollmer, Heribert
• SAT Interactions (Dagstuhl Seminar 12471)
  Creignou, Nadia ; Galesi, Nicola ; Kullmann, Oliver ; Vollmer, Heribert
• Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
  Böhler, Elmar ; Creignou, Nadia ; Galota, Matthias ; Reith, Steffen ; Schnoor, Henning ; Vollmer, Heribert 2016 Universität Würzburg
• Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
  Chimani, Markus ; Hedtke, Ivo ; Wiedera, Tilo 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Higher-Order Quantified Boolean Satisfiability
  Chistikov, Dmitry ; Haase, Christoph ; Hadizadeh, Zahra ; Mansutti, Alessio 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis
  Yamakami, Tomoyuki 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's Theorem
  Ham, Lucy 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity of Approximating Bounded-Degree Boolean #CSP
  Dyer, Martin ; Goldberg, Leslie Ann ; Jalsenius, Markus ; Richerby, David 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decision Procedures – An Algorithmic Point of View
  Kroening, Daniel ; Strichman, Ofer 2016 Springer Berlin
• Bridging Constraint Satisfaction and Boolean Satisfiability
  Petke, Justyna 2015 Springer International Publishing
• Generic hardness of the Boolean satisfiability problem
  Rybalov, Alexander
• Decision Procedures – An Algorithmic Point of View
  Kroening, Daniel ; Strichman, Ofer 2016 Springer Berlin
• The Unique Horn-Satisfiability problem and quadratic Boolean equations
  Minoux, M.