References in zbMATH (referenced in 85 articles )

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

1 2 3 4 5 next

  1. Alam, Jawaherul Md.; Bekos, Michael A.; Dujmović, Vida; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey: On dispersable book embeddings (2021)
  2. Ansótegui, Carlos; Ojeda, Jesús; Pacheco, Antonio; Pon, Josep; Salvia, Josep M.; Torres, Eduard: OptiLog: a framework for SAT-based systems (2021)
  3. Bonet, Maria Luisa; Buss, Sam; Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: Propositional proof systems based on maximum satisfiability (2021)
  4. Cai, Shaowei; Zhang, Xindi: Deep cooperation of CDCL and local search for SAT (2021)
  5. Fleury, Mathias; Biere, Armin: Efficient all-UIP learned clause minimization (2021)
  6. Froleyks, Nils; Heule, Marijn; Iser, Markus; Järvisalo, Matti; Suda, Martin: SAT competition 2020 (2021)
  7. Giráldez-Cru, Jesús; Levy, Jordi: Popularity-similarity random SAT formulas (2021)
  8. Heule, Marijn J. H.; Kauers, Manuel; Seidl, Martina: New ways to multiply (3 \times3)-matrices (2021)
  9. Kyrillidis, Anastasios; Shrivastava, Anshumali; Vardi, Moshe Y.; Zhang, Zhiwei: Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (2021)
  10. Manthey, Norbert: The \textscMergeSatsolver (2021)
  11. Nawrocki, Wojciech; Liu, Zhenjun; Fröhlich, Andreas; Heule, Marijn J. H.; Biere, Armin: XOR local search for Boolean Brent equations (2021)
  12. Prevot, Nicolas; Soos, Mate; Meel, Kuldeep S.: Leveraging GPUs for effective clause sharing in parallel SAT solving (2021)
  13. Schreiber, Dominik; Sanders, Peter: Scalable SAT solving in the cloud (2021)
  14. Amendola, Giovanni; Ricca, Francesco; Truszczynski, Miroslaw: New models for generating hard random Boolean formulas and disjunctive logic programs (2020)
  15. Gerault, David; Lafourcade, Pascal; Minier, Marine; Solnon, Christine: Computing AES related-key differential characteristics with constraint programming (2020)
  16. Juma, Nahid; Dietl, Werner; Tripunitara, Mahesh: A computational complexity analysis of tunable type inference for Generic Universe Types (2020)
  17. Junttila, Tommi; Karppa, Matti; Kaski, Petteri; Kohonen, Jukka: An adaptive prefix-assignment technique for symmetry reduction (2020)
  18. Kaufmann, Daniela; Biere, Armin; Kauers, Manuel: Incremental column-wise verification of arithmetic circuits using computer algebra (2020)
  19. Kochemazov, Stepan: Improving implementation of SAT competitions 2017--2019 winners (2020)
  20. Lagniez, Jean-Marie; Lonca, Emmanuel; Marquis, Pierre: Definability for model counting (2020)

1 2 3 4 5 next