Skip to main content
Qinzhou Niu on Muck Rack

Qinzhou Niu

As seen in: MDPI
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Qinzhou

Contact Qinzhou, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems

|
By Yuexin Huang, Yanfang Song, Qinzhou Niu
| MDPI
1. Introduction The SAT (satisfiability) problem involves determining whether a given Boolean formula has a satisfiable assignment. As one of the classical problems in computer science and among the most notable NP-complete problems in computational complexity theory [1], SAT has been extensively studied and discussed for nearly a century.
Open in Who Shared Issue with article?
See all 1 articles