References in zbMATH (referenced in 51 articles )

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

1 2 3 next

  1. Alam, Jawaherul Md.; Bekos, Michael A.; Dujmović, Vida; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey: On dispersable book embeddings (2021)
  2. Bonet, Maria Luisa; Buss, Sam; Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: Propositional proof systems based on maximum satisfiability (2021)
  3. Froleyks, Nils; Heule, Marijn; Iser, Markus; Järvisalo, Matti; Suda, Martin: SAT competition 2020 (2021)
  4. Giráldez-Cru, Jesús; Levy, Jordi: Popularity-similarity random SAT formulas (2021)
  5. Heule, Marijn J. H.; Kauers, Manuel; Seidl, Martina: New ways to multiply (3 \times3)-matrices (2021)
  6. Juma, Nahid; Dietl, Werner; Tripunitara, Mahesh: A computational complexity analysis of tunable type inference for Generic Universe Types (2020)
  7. Junttila, Tommi; Karppa, Matti; Kaski, Petteri; Kohonen, Jukka: An adaptive prefix-assignment technique for symmetry reduction (2020)
  8. Kaufmann, Daniela; Biere, Armin; Kauers, Manuel: Incremental column-wise verification of arithmetic circuits using computer algebra (2020)
  9. Kochemazov, Stepan: Improving implementation of SAT competitions 2017--2019 winners (2020)
  10. Li, Chu-Min; Xiao, Fan; Luo, Mao; Manyà, Felip; Lü, Zhipeng; Li, Yu: Clause vivification by unit propagation in CDCL SAT solvers (2020)
  11. Nabeshima, Hidetomo; Inoue, Katsumi: Reproducible efficient parallel SAT solving (2020)
  12. Otpuschennikov, Ilya V.; Semenov, Alexander A.: Using merging variables-based local search to solve special variants of MaxSAT problem (2020)
  13. Pashkovich, Kanstantsin; Poirrier, Laurent: Three-dimensional stable matching with cyclic preferences (2020)
  14. Semenov, Alexander; Otpuschennikov, Ilya; Gribanova, Irina; Zaikin, Oleg; Kochemazov, Stepan: Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems (2020)
  15. Vallade, Vincent; Le Frioux, Ludovic; Baarir, Souheib; Sopena, Julien; Ganesh, Vijay; Kordon, Fabrice: Community and LBD-based clause sharing policy for parallel SAT solving (2020)
  16. Vinyals, Marc; Elffers, Jan; Johannsen, Jan; Nordström, Jakob: Simplified and improved separations between regular and general resolution by lifting (2020)
  17. Yolcu, Emre; Wu, Xinyu; Heule, Marijn J. H.: Mycielski graphs and PR proofs (2020)
  18. Bachmeier, Georg; Brandt, Felix; Geist, Christian; Harrenstein, Paul; Kardel, Keyvan; Peters, Dominik; Seedig, Hans Georg: (k)-majority digraphs and the hardness of voting with a constant number of voters (2019)
  19. Bean, Christian; Gudmundsson, Bjarki; Ulfarsson, Henning: Automatic discovery of structural rules of permutation classes (2019)
  20. Beleĭ, Evgeniya Gennad’evna; Semënov, Aleksandr Anatol’evich: On propositional coding techniques for the distinguishability of objects in finite sets (2019)

1 2 3 next