Paul Saikko
Computational Theory and Mathematics · 2015
A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 5 citations into it
- Computer Networks and Communications — 5 citations into it
Whom Paul Saikko trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Paul Saikko's perspective
Ordered by how strongly the researchers Paul Saikko trusts endorse each paper. Same corpus, a different order for every researcher.
- An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)
- Iterative and core-guided MaxSAT solving: A survey and assessment
- Solving MAXSAT by Solving a Sequence of Simpler SAT Instances
- Effective Preprocessing in SAT Through Variable and Clause Elimination (International Conference on Theory and Applications of Satisfiability Testing)
- Maximum Satisfiability Using Core-Guided MaxSAT Resolution
- On Solving the Partial MAX-SAT Problem (International Conference on Theory and Applications of Satisfiability Testing)
- A Structure-Preserving Clause Form Translation
- Efficient CNF Encoding of Boolean Cardinality Constraints
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- On the Complexity of Derivation in Propositional Calculus
Their papers
- Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT (2015) — 16 citations