„Boolean Formulas“

Suchergebnisse

40 Treffer

• Decidability and Complexity of Tree Share Formulas
  Le, Xuan Bach ; Hobor, Aquinas ; Lin, Anthony W. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Sensitivity Conjecture for Read-k Formulas
  Bafna, Mitali ; Lokam, Satyanarayana V. ; Tavenas, Sébastien ; Velingker, Ameya 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decision Procedures – An Algorithmic Point of View
  Kroening, Daniel ; Strichman, Ofer 2016 Springer Berlin
• Boolean combinations of monadic formulas
  Comer, S. D.
• PBCounter: weighted model counting on pseudo-boolean formulas
  Lai, Yong ; Xu, Zhenghang ; Yin, Minghao
• Decision Procedures – An Algorithmic Point of View
  Kroening, Daniel ; Strichman, Ofer 2016 Springer Berlin
• Complexity and probability of some Boolean formulas
  Savický, Petr 1994 Dekanat Informatik, Univ.
• On the complexity of realization of the linear function by formulas over finite Boolean bases
  CHERUKHIN, D.YU.
• On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
  Sergeev, Igor' S.
• One criterion for comparability of bases for the realization of Boolean functions by formulas
  Muchnik, B. A.
• A Dichotomy Theorem for Learning Quantified Boolean Formulas
  Dalmau, Víictor
• Satisfiability Testing for Boolean Formulas Using Δ-trees
  Gutiérrez, G. ; de Guzmán, I. P. ; Martínez, J. ; Ojeda-Aciego, M. ; Valverde, A.
• Boolean Functions as Models for Quantified Boolean Formulas
  Kleine Büning, Hans ; Subramani, K. ; Zhao, Xishun
• Strengthening convex relaxations of 0/1-sets using Boolean formulas
  Fiorini, Samuel ; Huynh, Tony ; Weltge, Stefan
• On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
  Sergeev, I. S.
• Complexity and depth of formulas for symmetric Boolean functions
  Sergeev, I. S.
• Subclasses of quantified Boolean formulas
  Flögel, Andreas ; Karpiński, Marek ; Kleine Büning, Hans 1990 Inst. für Informatik
• A resolution method for quantified Boolean formulas
  Karpiński, Marek ; Kleine Büning, Hans 1990 Inst. für Informatik
• Model-based transformations for quantified boolean formulas
  Bubeck, Uwe 2010 AKA
• The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
  Schwerdtfeger, Konrad W.