Understanding Random SAT: Beyond the Clauses-to-Variables Ratio-Reference-Cited by-同舟云学术

Understanding Random SAT: Beyond the Clauses-to-Variables Ratio

Published:2004 Issue: Volume: Page:438-452
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2004
language:
Short-container-title:

Author:

Nudelman Eugene,Leyton-Brown Kevin,Hoos Holger H.,Devkar Alex,Shoham Yoav

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30201-8_33.pdf

Reference18 articles.

1. Lecture Notes in Computer Science;F. Bacchus,2004

2. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proc. IJCAI 1991, pp. 331–337 (1991)

3. Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning 24(1), 67–100 (2000)

4. Hoos, H.H., Stützle, T.: Stochastic Local Search – Foundations and Applications. Morgan Kaufmann, San Francisco (2004) (to appear)

5. Hoos, H.H.: SAT-encodings, search space structure, and local search performance. In: Proc. IJCAI 1999, pp. 296–302. Morgan Kaufmann, San Francisco (1999)

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

1. Graph neural network based time estimator for SAT solver;International Journal of Machine Learning and Cybernetics;2024-08-31

2. SeeMLess: Security Evaluation of Logic Locking using Machine Learning oriented Estimation;Proceedings of the Great Lakes Symposium on VLSI 2024;2024-06-12

3. On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming;Proceedings of the 7th International Conference on Algorithms, Computing and Systems;2023-10-19

4. A Security-Aware and LUT-Based CAD Flow for the Physical Synthesis of hASICs;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-10

5. Logic Locking in Future IC Supply Chain Environments;Understanding Logic Locking;2023-09-23