scientific article; zbMATH DE number 2157028

MaRDI QIDQ4669592zbMATH OpenFDO

Authors Fengren Yu, Haiming Qiu

Publication date 15 April 2005

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A complexity analysis of the SAT problem
• A numerical approach to 3-SAT
• A simplified NP-complete satisfiability problem
• The complexity of satisfiability problems
• scientific article; zbMATH DE number 4039349

Cited in

(8)

• SAT problems with chains of dependent variables
• Some variants of SAT and their properties
• A mathematic-physical approach to the satisfiability problem
• A sufficient condition for Morgan's problem
• scientific article; zbMATH DE number 5605058 (Why is no real title available?)
• A numerical approach to 3-SAT
• An algorithm for approximating the satisfiability problem of high-level conditions
• A complexity analysis of the SAT problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4669592)