Author:
Brakensiek Joshua,Heule Marijn,Mackey John,Narváez David
Publisher
Springer International Publishing
Reference29 articles.
1. Aloul, F.A., Markov, I.L., Sakallah, K.A.: Shatter: efficient symmetry-breaking for Boolean satisfiability. In: Proceedings of the 40th Annual Design Automation Conference, DAC 2003, pp. 836–839. ACM, Anaheim (2003)
2. Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT competition 2018. In: 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)
3. Corrádi, K., Szabó, S.: A combinatorial approach for Keller’s conjecture. Period. Math. Hungar. 21, 91–100 (1990)
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);L Cruz-Filipe,2017
5. Debroni, J., Eblen, J., Langston, M., Myrvold, W., Shor, P.W., Weerapurage, D.: A complete resolution of the Keller maximum clique problem. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 129–135. SIAM, Society for Industrial and Applied Mathematics, Philadelphia (2011)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献