Pages that link to "Item:Q1380432"
From MaRDI portal
The following pages link to Hierarchies of polynomially solvable satisfiability problems (Q1380432):
Displaying 16 items.
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Polynomially solvable satisfiability problems (Q1114394) (← links)
- A hierarchy of propositional Horn formuls (Q1122571) (← links)
- A hierarchy of tractable satisfiability problems (Q1208436) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- On some tractable classes in deduction and abduction (Q1978251) (← links)
- Proper hierarchies in polylogarithmic time and absence of complete problems (Q2206779) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- (Q3154862) (← links)
- Polynomial-time functions generate SAT: On P-splinters (Q3975148) (← links)
- Une famille d'algorithmes polynomiaux pour la résolution de classes d'instances du problème SAT. (A family of polynomial algorithms for the solution of classes of instances of the SAT problem) (Q3985743) (← links)
- (Q4764625) (← links)
- (Q5506332) (← links)