PURL: a new polynomial-time solvable class of satisfiability

MaRDI QIDQ3606145zbMATH OpenFDO

Authors J. R. Portillo, J. I. Rodrigues

Publication date 26 February 2009

zbMATH Keywords

SATsatisfiabilityCNF-formula

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Polynomially solvable satisfiability problems
• A perspective on certain polynomial-time solvable classes of satisfiability
• Two tractable subclasses of minimal unsatisfiable formulas
• The complexity of satisfiability problems
• Hierarchies of polynomially solvable satisfiability problems

Cited in

(2)

• A perspective on certain polynomial-time solvable classes of satisfiability
• scientific article; zbMATH DE number 5139167 (Why is no real title available?)

This page was built for publication: PURL: a new polynomial-time solvable class of satisfiability

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