These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
100 related articles for article (PubMed ID: 33286027)
1. (1,0)-Super Solutions of ( Fu Z; Xu D; Wang Y Entropy (Basel); 2020 Feb; 22(2):. PubMed ID: 33286027 [TBL] [Abstract][Full Text] [Related]
2. Uniquely Satisfiable Fu Z; Xu D Entropy (Basel); 2020 May; 22(5):. PubMed ID: 33286341 [TBL] [Abstract][Full Text] [Related]
3. A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form. Zhang Z; Xu D; Zhou J Entropy (Basel); 2021 Mar; 23(3):. PubMed ID: 33806451 [TBL] [Abstract][Full Text] [Related]
4. Communities of solutions in single solution clusters of a random K-satisfiability formula. Zhou H; Ma H Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066108. PubMed ID: 20365232 [TBL] [Abstract][Full Text] [Related]
5. A simplifier for propositional formulas with many binary clauses. Brafman RI IEEE Trans Syst Man Cybern B Cybern; 2004 Feb; 34(1):52-9. PubMed ID: 15369050 [TBL] [Abstract][Full Text] [Related]
6. A variable neighborhood Walksat-based algorithm for MAX-SAT problems. Bouhmala N ScientificWorldJournal; 2014; 2014():798323. PubMed ID: 25177732 [TBL] [Abstract][Full Text] [Related]
7. Maximally flexible solutions of a random K-satisfiability formula. Zhao H; Zhou HJ Phys Rev E; 2020 Jul; 102(1-1):012301. PubMed ID: 32794979 [TBL] [Abstract][Full Text] [Related]
8. The backtracking survey propagation algorithm for solving random K-SAT problems. Marino R; Parisi G; Ricci-Tersenghi F Nat Commun; 2016 Oct; 7():12996. PubMed ID: 27694952 [TBL] [Abstract][Full Text] [Related]
9. Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction. Wang X; Bao Z; Hu J; Wang S; Zhan A Biosystems; 2008 Jan; 91(1):117-25. PubMed ID: 17904730 [TBL] [Abstract][Full Text] [Related]
10. The surface-based approach for DNA computation is unreliable for SAT. Li D; Li X; Huang H; Li X Biosystems; 2005 Oct; 82(1):20-5. PubMed ID: 16024166 [TBL] [Abstract][Full Text] [Related]
11. Use of cellulose nanofibers as a denture immersing solution. Zou W; Hong G; Yamazaki Y; Takase K; Ogawa T; Washio J; Takahashi N; Sasaki K Dent Mater J; 2020 Jan; 39(1):80-88. PubMed ID: 31611498 [TBL] [Abstract][Full Text] [Related]
12. Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming. Schawe H; Bleim R; Hartmann AK PLoS One; 2019; 14(4):e0215309. PubMed ID: 31002678 [TBL] [Abstract][Full Text] [Related]
13. Witness of unsatisfiability for a random 3-satisfiability formula. Wu LL; Zhou HJ; Alava M; Aurell E; Orponen P Phys Rev E Stat Nonlin Soft Matter Phys; 2013 May; 87(5):052807. PubMed ID: 23767584 [TBL] [Abstract][Full Text] [Related]
14. Enabling Workforce Optimization in Constrained Attribute-Based Access Control Systems. Roy A; Sural S; Majumdar AK; Vaidya J; Atluri V IEEE Trans Emerg Top Comput; 2021; 9(4):1901-1913. PubMed ID: 34900448 [TBL] [Abstract][Full Text] [Related]
15. Biased random satisfiability problems: from easy to hard instances. Ramezanpour A; Moghimi-Araghi S Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066101. PubMed ID: 16089814 [TBL] [Abstract][Full Text] [Related]
16. Efficient solution of Boolean satisfiability problems with digital memcomputing. Bearden SRB; Pei YR; Di Ventra M Sci Rep; 2020 Nov; 10(1):19741. PubMed ID: 33184386 [TBL] [Abstract][Full Text] [Related]