Pages that link to "Item:Q1861558"

The following pages link to A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558):

Displaying 25 items.

• About some UP-based polynomial fragments of SAT (Q513329) (← links)
• Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
• Linear CNF formulas and satisfiability (Q1028433) (← links)
• Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
• Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
• Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
• On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
• Generalizations of matched CNF formulas (Q1777405) (← links)
• Investigations on autark assignments (Q1841885) (← links)
• Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. (Q1853126) (← links)
• Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
• A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
• The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← links)
• Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
• A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
• Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
• Resolution complexity of random constraint satisfaction problems: Another half of the story (Q2581550) (← links)
• Properties of SLUR Formulae (Q2891367) (← links)
• Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
• Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story (Q3439112) (← links)
• Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
• A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
• (Q5150602) (← links)
• A CNF Formula Hierarchy over the Hypercube (Q5385533) (← links)
• An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)