From post

Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework.

, , , и . TACAS (1), том 11427 из Lecture Notes in Computer Science, стр. 135-151. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

On the Usefulness of Clause Strengthening in Parallel SAT Solving., , , , и . NFM, том 12229 из Lecture Notes in Computer Science, стр. 222-229. Springer, (2020)Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework., , , и . TACAS (1), том 11427 из Lecture Notes in Computer Science, стр. 135-151. Springer, (2019)A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers., , и . CP, том 12333 из Lecture Notes in Computer Science, стр. 899-916. Springer, (2020)Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving., , , , , и . SAT, том 12178 из Lecture Notes in Computer Science, стр. 11-27. Springer, (2020)Towards more efficient parallel SAT solving. (Vers une parallélisation efficace de la résolution du problème de satisfaisabilité).. Sorbonne UniversitY, France, (2019)PaInleSS: A Framework for Parallel SAT Solving., , , и . SAT, том 10491 из Lecture Notes in Computer Science, стр. 233-250. Springer, (2017)