scientific article
From MaRDI portal
Publication:2769034
zbMath1042.68604MaRDI QIDQ2769034
No author found.
Publication date: 4 February 2002
Full work available at URL: http://www.ams.org/notices/199510/199510-toc.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (17)
Dichotomies for classes of homomorphism problems involving unary functions ⋮ Boolean grammars ⋮ Infinity problems and countability problems for \(\omega \)-automata ⋮ A Logical Characterization of Small 2NFAs ⋮ The first order theory of \(G(n, c/n)\) ⋮ A note on first-order projections and games. ⋮ Expressive power of SQL. ⋮ On the power of tree-walking automata. ⋮ Low-level dichotomy for quantified constraint satisfaction problems ⋮ Equilibrium semantics of languages of imperfect information ⋮ ON A QUESTION OF KRAJEWSKI’S ⋮ Reversal complexity revisited ⋮ CATEGORICAL COMPLEXITY ⋮ On the reducibility of sets inside NP to sets with low information content ⋮ Descriptive complexity and revealed preference theory ⋮ Adding for-loops to first-order logic ⋮ Complexity of local, global and universality properties in finite dynamical systems
This page was built for publication:
