Jan Elffers
Jan Elffers
PhD student, Lund University
Verified email at cs.lth.se
Title
Cited by
Cited by
Year
Divide and Conquer: Towards Faster Pseudo-Boolean Solving.
J Elffers, J Nordström
IJCAI, 1291-1299, 2018
242018
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.
J Elffers, J Giráldez-Cru, S Gocht, J Nordström, L Simon
IJCAI, 1300-1308, 2018
192018
In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
M Vinyals, J Elffers, J Giráldez-Cru, S Gocht, J Nordström
International Conference on Theory and Applications of Satisfiability …, 2018
132018
CNFgen: A Generator of Crafted Benchmarks
M Lauria, J Elffers, J Nordström, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2017
132017
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
J Elffers, J Johannsen, M Lauria, T Magnard, J Nordström, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2016
122016
Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
J Elffers, J Giráldez-Cru, J Nordström, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2018
102018
Scheduling with two non-unit task lengths is NP-complete
J Elffers, M de Weerdt
arXiv preprint arXiv:1412.3095, 2014
42014
A Cardinal Improvement to Pseudo-Boolean Solving.
J Elffers, J Nordström
AAAI, 1495-1503, 2020
32020
Simplified and Improved Separations Between Regular and General Resolution by Lifting
M Vinyals, J Elffers, J Johannsen, J Nordström
Proceedings of the 23rd International Conference on Theory and Applications …, 2020
12020
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
V Liew, P Beame, J Devriendt, J Elffers, J Nordström
TU Wien Academic Press 1, 194-204, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–10