„Boolesche Formel“

Suchergebnisse

1.000+ Treffer

• Scalable SAT Solving and its Application
  Schreiber, Dominik Pascal ; Sanders, Peter ; Biere, Armin 2023 KIT-Bibliothek
• On safety verification using PDR and Reverse PDR
  Seufert, Tobias ; Scholl, Christoph ; Biere, Armin 2023 Universität
• Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure – Proof Engines for the Analysis of Hybrid Discrete-Continuous Systems
  2011 Vieweg+Teubner
• Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy
  Döcker, Janosch 2021 Universitätsbibliothek Tübingen
• complexity of quantified conflict driven clause learning
  Böhm, Benjamin ; Beyersdorff, Olaf ; Mahajan, Meena ; Slivovsky, Friedrich 2025 Friedrich-Schiller-Universität Jena
• Theory and Applications of Satisfiability Testing – SAT 2013 – 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings
  Järvisalo, Matti ; Van Gelder, Allen 2013 Springer Berlin Heidelberg
• Theory and applications of satisfiability testing – 9th international conference, Seattle, WA, USA, August 12 - 15, 2006 ; proceedings
  Biere, Armin 2006 Springer
• Theory and applications of satisfiability testing – 7th international conference ; revised selected papers
  Hoos, Holger H. 2005 Springer
• Theory and applications of satisfiability testing – 8th international conference ; proceedings
  Bacchus, Fahiem 2005 Springer
• Theory and applications of satisfiability testing – 6th international conference ; selected revised papers
  Giunchiglia, Enrico 2004 Springer
• SAT Solving Using XOR-OR-AND Normal Forms and Cryptographic Fault Attacks
  Danner, Julian ; Kreuzer, Martin ; Biere, Armin 2025 Universität Passau
• WoLFram - A Word Level Framework for Formal Verification and its Application
  Sülflow, André 2010 Shaker
• SAT-based String Solving – Solving String Constraints by Reduction to Boolean Satisfiability
  Lotz, Kevin ; Nowotka, Dirk ; Manea, Florin Silviu 2025 Universitätsbibliothek Kiel
• The computational complexity of equivalence and isomorphism problems
  Thierauf, Thomas 2001 Springer
• The computational complexity of equivalence and isomorphism problems
  Thierauf, Thomas
• Tradeoff zwischen Grösse und Tiefe Boolescher Formeln
  Commentz-Walter, Beate
• Quermaßdichten für Punktprozesse konvexer Körper und Boolesche Modelle
  Fallert, Hermann
• Theory and applications of satisfiability testing – 12th international conference ; proceedings
  Kullmann, Oliver 2009 Springer
• Theory and applications of satisfiability testing – 11th international conference ; proceedings
  Kleine Büning, Hans 2008 Springer
• Theory and applications of satisfiability testing – 10th international conference ; proceedings
  Marques-Silva, João 2007 Springer