B. Schaafsma

Computational Theory and Mathematics · 2013

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 6 citations into it; #10,694 of 12,182 by trust here, #7,501 by citations

Whom B. Schaafsma trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Niklas Eén

Who trusts B. Schaafsma overall

1. Aws Albarghouthi

Papers from B. Schaafsma's perspective

Ordered by how strongly the researchers B. Schaafsma trusts endorse each paper. Same corpus, a different order for every researcher.

1. An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)
2. I and J
3. On the Complexity of Derivation in Propositional Calculus
4. A machine program for theorem-proving (CACM)
5. Temporal induction by incremental SAT solving (BMC@CAV)
6. Cha : Engineering an e cient SAT solver (Design Automation Conference)
7. The Art of Computer Programming: Volume 3: Sorting and Searching
8. Efficient CNF Encoding of Boolean Cardinality Constraints
9. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
10. A Structure-Preserving Clause Form Translation

Their papers

• The MathSAT5 SMT Solver (2013) — 563 citations