Author:
Vander-Swalmen Pascal,Dequen Gilles,Krajecki Michaël
Publisher
Springer Science and Business Media LLC
Subject
Information Systems,Theoretical Computer Science,Software
Reference24 articles.
1. Cook, S.A.: The complexity of theorem proving procedures. In: 3rd ACM Symposium on Theory of Computing, pp. 151–158. Ohio (1971)
2. Braunstein A., Mézard M., Zecchina R.: Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms 27(2), 201–226 (2005)
3. Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic and stochastic search. In: Proceedings of the 30th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pp. 1194–1201. AAAI Press / MIT Press, Menlo Park, 4–8 August 1996
4. Biere, A., Heljanko, K., Junttila, T., Latvala, T., Schuppan, V.: Linear encodings of bounded LTL model checking. Logic. Method Computer Sci. 2, (2006)
5. Potlapally N.R., Raghunathan A., Ravi S., Jha N.K., Lee R.B.: Aiding side-channel attacks on cryptographic software with satisfiability-based analysis. IEEE Trans. VLSI Syst. 15(4), 465–470 (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel Satisfiability Solver Based on Hybrid Partitioning Method;2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP);2017
2. An overview of parallel SAT solving;Constraints;2012-04-11
3. Learning Algorithm Portfolios for Parallel Execution;Lecture Notes in Computer Science;2012
4. Improving Search Space Splitting for Parallel SAT Solving;2010 22nd IEEE International Conference on Tools with Artificial Intelligence;2010-10
5. Toward Easy Parallel SAT Solving;2009 21st IEEE International Conference on Tools with Artificial Intelligence;2009-11