Distributed Cube and Conquer with Paracooba-Reference-Cited by-同舟云学术

Distributed Cube and Conquer with Paracooba

Published:2020 Issue: Volume: Page:114-122
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2020
language:
Short-container-title:

Author:

Heisinger Maximilian,Fleury Mathias^ORCID,Biere Armin^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-51825-7_9

Reference36 articles.

1. Lecture Notes in Computer Science;G Audemard,2017

2. Lecture Notes in Computer Science;G Audemard,2012

3. Lecture Notes in Computer Science;T Balyo,2015

4. Balyo, T., Sinz, C.: Parallel satisfiability. Handbook of Parallel Constraint Reasoning, pp. 3–29. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-63516-3_1

5. Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT Competition 2018. In: Heule, M., Järvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2018 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2018-1, pp. 13–14. University of Helsinki (2018)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving;Tools and Algorithms for the Construction and Analysis of Systems;2023

2. Bounds for the Security of Ascon against Differential and Linear Cryptanalysis;IACR Transactions on Symmetric Cryptology;2022-03-11

3. Decentralized Online Scheduling of Malleable NP-hard Jobs;Euro-Par 2022: Parallel Processing;2022

4. Dagster: Parallel Structured Search with Case Studies;Lecture Notes in Computer Science;2022

5. Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers;Form Comp Aid Design;2022