JBool

This software promotes some general and useful tools for handling, editing and computing (on) Boolean Functions defined either by conjonctive normal forms (clausal) or by disjonctive ones. Boolean Functions: Theory, Algorithms and Applications, Y. Crama and P.L. Hammer (Ed.) (2011) Appendix C

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 115 articles )

Showing results 1 to 20 of 115.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Brenner, Ulrich; Silvanus, Anna; Silvanus, Jannik: Constructing depth-optimum circuits for adders and \textscAnd-\textscOrpaths (2022)
  2. Fischer, Anja; Fischer, Frank; McCormick, S. Thomas: Matroid optimization problems with monotone monomials in the objective (2022)
  3. Defrain, Oscar; Nourine, Lhouari; Vilmin, Simon: Translating between the representations of a ranked convex geometry (2021)
  4. Ganian, Robert; Szeider, Stefan: New width parameters for SAT and #SAT (2021)
  5. Ismagilov, Niyaz; Borovitskiy, Viacheslav; Lifshits, Mikhail; Platonova, Mariia: Boolean spectral analysis in categorical reservoir modeling (2021)
  6. Jukna, Stasys: Notes on hazard-free circuits (2021)
  7. Lozin, Vadim; Moshkov, Mikhail: Critical properties and complexity measures of read-once Boolean functions (2021)
  8. Plischke, Elmar; Rabitti, Giovanni; Borgonovo, Emanuele: Computing Shapley effects for sensitivity analysis (2021)
  9. Boros, Endre; Crama, Yves; Rodríguez-Heck, Elisabeth: Compact quadratizations for pseudo-Boolean functions (2020)
  10. Couceiro, Miguel; Lehtonen, Erkko; Mercuriali, Pierre; Péchoux, Romain: On the efficiency of normal form systems for representing Boolean functions (2020)
  11. Emelyanov, Pavel; Ponomaryov, Denis: The complexity of AND-decomposition of Boolean functions (2020)
  12. Kaznatcheev, Artem; Cohen, David A.; Jeavons, Peter G.: Representing fitness landscapes by valued constraints to understand the complexity of local search (2020)
  13. Verma, Amit; Lewis, Mark: Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (2020)
  14. Abou-Jaoudé, Wassim; Monteiro, Pedro T.: On logical bifurcation diagrams (2019)
  15. Boros, Endre; Gurvich, Vladimir; Milanič, Martin: Decomposing 1-Sperner hypergraphs (2019)
  16. Bruni, Renato; Bianchi, Gianpiero; Dolente, Cosimo; Leporelli, Claudio: Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior (2019)
  17. Buchheim, Christoph; Crama, Yves; Rodríguez-Heck, Elisabeth: Berge-acyclic multilinear 0-1 optimization problems (2019)
  18. Chiarelli, Nina; Milanič, Martin: Linear separation of connected dominating sets in graphs (2019)
  19. Couceiro, Miguel; Mercuriali, Pierre; Péchoux, Romain; Saffidine, Abdallah: On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials (2019)
  20. Hitchcock, John M.; Sekoni, Adewale: Nondeterminisic sublinear time has measure 0 in P (2019)

1 2 3 4 5 6 next