scientific article; zbMATH DE number 6748864
From MaRDI portal
Publication:5278401
DOI10.4230/LIPIcs.CSL.2016.15zbMath1369.68219MaRDI QIDQ5278401
Publication date: 19 July 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of universal algebra in computer science (08A70) Semigroups in automata theory, linguistics, etc. (20M35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)
Related Items (4)
Quantified Constraints in Twenty Seventeen ⋮ The number of clones determined by disjunctions of unary relations ⋮ The Complexity of Quantified Constraints Using the Algebraic Formulation ⋮ The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
This page was built for publication:
