scientific article; zbMATH DE number 978246

zbMath0863.68073MaRDI QIDQ4332422

Jerzy Tiuryn, Vaughan R. Pratt

Publication date: 3 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(P\)-satisfiabilitytractable posets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (10)

Quantified conjunctive queries on partially ordered sets ⋮ Critical relations of crowns in critical times of coronavirus depression ⋮ Quantified Conjunctive Queries on Partially Ordered Sets ⋮ Colouring, constraint satisfaction, and complexity ⋮ Model checking existential logic on partially ordered sets ⋮ Retractions onto series-parallel posets ⋮ Maximizing sharing of protected information ⋮ Tractable constraints in finite semilattices ⋮ Some complexity bounds for subtype inequalities ⋮ Satisfying subtype inequalities in polynomial space

This page was built for publication: