References in zbMATH (referenced in 106 articles )

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

1 2 3 4 5 6 next

  1. Jukna, Stasys: Notes on hazard-free circuits (2021)
  2. Boros, Endre; Crama, Yves; Rodríguez-Heck, Elisabeth: Compact quadratizations for pseudo-Boolean functions (2020)
  3. Couceiro, Miguel; Lehtonen, Erkko; Mercuriali, Pierre; Péchoux, Romain: On the efficiency of normal form systems for representing Boolean functions (2020)
  4. Emelyanov, Pavel; Ponomaryov, Denis: The complexity of AND-decomposition of Boolean functions (2020)
  5. Kaznatcheev, Artem; Cohen, David A.; Jeavons, Peter G.: Representing fitness landscapes by valued constraints to understand the complexity of local search (2020)
  6. Verma, Amit; Lewis, Mark: Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (2020)
  7. Abou-Jaoudé, Wassim; Monteiro, Pedro T.: On logical bifurcation diagrams (2019)
  8. Boros, Endre; Gurvich, Vladimir; Milanič, Martin: Decomposing 1-Sperner hypergraphs (2019)
  9. Bruni, Renato; Bianchi, Gianpiero; Dolente, Cosimo; Leporelli, Claudio: Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior (2019)
  10. Buchheim, Christoph; Crama, Yves; Rodríguez-Heck, Elisabeth: Berge-acyclic multilinear 0-1 optimization problems (2019)
  11. Chiarelli, Nina; Milanič, Martin: Linear separation of connected dominating sets in graphs (2019)
  12. 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)
  13. Hitchcock, John M.; Sekoni, Adewale: Nondeterminisic sublinear time has measure 0 in P (2019)
  14. Hodžić, S.; Pasalic, E.; Chattopadhyay, A.: An iterative method for linear decomposition of index generating functions (2019)
  15. Huchette, Joey; Vielma, Juan Pablo: A combinatorial approach for small and strong formulations of disjunctive constraints (2019)
  16. Kučera, Petr; Savický, Petr; Vorel, Vojtěch: A lower bound on CNF encodings of the at-most-one constraint (2019)
  17. Bach, Eric; Dusart, Jérémie; Hellerstein, Lisa; Kletenik, Devorah: Submodular goal value of Boolean functions (2018)
  18. Boros, Endre; Gurvich, Vladimir; Milanič, Martin; Oudalov, Vladimir; Vičič, Jernej: A three-person deterministic graphical game without Nash equilibria (2018)
  19. Brabant, Quentin; Couceiro, Miguel: (k)-maxitive Sugeno integrals as aggregation models for ordinal preferences (2018)
  20. Can, Yavuz: Disjointed sum of products by a novel technique of orthogonalizing ORing (2018)

1 2 3 4 5 6 next