scientific article; zbMATH DE number 978246

MaRDI QIDQ4332422zbMATH OpenFDO

Authors Jerzy Tiuryn, Vaughan R. Pratt

Publication date 3 June 1997

zbMATH Keywords

\(P\)-satisfiabilitytractable posets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Tractable constraints in finite semilattices
• Tractable constraints in finite semilattices
• The inequality-satisfiability problem
• The Complexity of the Extendibility Problem for Finite Posets
• A complexity dichotomy for poset constraint satisfaction

Cited in

(11)

• Tractable constraints in finite semilattices
• Axiomatisability problems for \(S\)-posets
• Satisfying subtype inequalities in polynomial space
• Maximizing sharing of protected information
• Quantified conjunctive queries on partially ordered sets
• Quantified conjunctive queries on partially ordered sets
• Colouring, constraint satisfaction, and complexity
• The Complexity of the Extendibility Problem for Finite Posets
• Critical relations of crowns in critical times of coronavirus depression
• Some complexity bounds for subtype inequalities
• Retractions onto series-parallel posets

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 Q4332422)