References in zbMATH (referenced in 12 articles )

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

  1. Heule, Marijn J.H.; Seidl, Martina; Biere, Armin: Solution validation and extraction for QBF preprocessing (2017)
  2. Balyo, Tomáš; Biere, Armin; Iser, Markus; Sinz, Carsten: SAT race 2015 (2016)
  3. Dobraunig, Christoph; Eichlseder, Maria; Mendel, Florian; Schläffer, Martin: Cryptanalysis of Ascon (2015)
  4. Konev, Boris; Lisitsa, Alexei: Computer-aided proof of Erd\Hosdiscrepancy properties (2015)
  5. Oh, Chanseok: Between SAT and UNSAT: the fundamental difference in CDCL SAT (2015)
  6. Wetzler, Nathan; Heule, Marijn J. H.; Hunt, Warren A. jun.: DRAT-trim: efficient checking and trimming using expressive clausal proofs (2014)
  7. Belov, Anton; Morgado, António; Marques-Silva, Joao: SAT-based preprocessing for maxsat (2013)
  8. Fagerberg, Rolf; Flamm, Christoph; Merkle, Daniel; Peters, Philipp; Stadler, Peter F.: On the complexity of reconstructing chemical reaction networks (2013)
  9. Martins, Ruben; Manquinho, Vasco; Lynce, In^es: An overview of parallel SAT solving (2012)
  10. Asín, Roberto; Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric: Cardinality networks: a theoretical and empirical study (2011)
  11. Heule, Marijn J.H.; Järvisalo, Matti; Biere, Armin: Efficient CNF simplification based on binary implication graphs (2011)
  12. Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka: Partitioning SAT instances for distributed solving (2010)


Further publications can be found at: http://fmv.jku.at/papers/index.html