scientific article; zbMATH DE number 922624
From MaRDI portal
Publication:4893144
zbMATH Open0854.03042MaRDI QIDQ4893144
Publication date: 13 January 1997
Title of this publication is not available (Why is that?)
posetspolynomial timealternationtransitive closure logiccomplexity of type reconstruction with subtypessatisfiability of systems of inequalities
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (7)
An Implementation of Variable Upper Bounds via SUB Methodology ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption ⋮ A note on the decidability of subword inequalities ⋮ Title not available (Why is that?) ⋮ Lower bounds for invariant queries in logics with counting.
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 Q4893144)
