Mengyu Guo

Aug 8, 2024 | peerj.com | Wenjing Chang |Mengyu Guo |Henan Polytechnic |Junwei Luo

The Boolean satisfiability (SAT) problem is a classic problem in mathematical logic, which involves determining whether there exists at least one assignment to the variables such that the given formula evaluates to true. If such an assignment exists, the SAT problem is satisfiable; otherwise, it is unsatisfiable.

Apr 30, 2024 | mdpi.com | Zibin Mao |Yiquan Cai |Mengyu Guo |Zhen Ma

All articles published by MDPI are made immediately available worldwide under an open access license. No specialpermission is required to reuse all or part of the article published by MDPI, including figures and tables. Forarticles published under an open access Creative Common CC BY license, any part of the article may be reused withoutpermission provided that the original article is clearly cited. For more information, please refer tohttps://www.mdpi.com/openaccess.

Jan 4, 2024 | dx.doi.org | Wenjiao Fu |Mengyu Guo |Xuemei Zhou |Zhenzhen Wang

Download Hi-Res ImageDownload to MS-PowerPointCite This:ACS Nano 2024, XXXX, XXX Terms & Conditions Most electronic Supporting Information files are available without a subscription to ACS Web Editions. Such files may be downloaded by article for research use (if there is a public use license linked to the relevant article, that license may permit other uses).