scientific article; zbMATH DE number 2079027
From MaRDI portal
Publication:4474839
zbMath1044.68629MaRDI QIDQ4474839
Etienne Grandjean, Frédéric Olive
Publication date: 21 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitymonadic second-order logicnondeterminismlinear timefinite model theoryNP-complete problemrandom access machine
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13)
Related Items (3)
A descriptive complexity approach to the linear hierarchy. ⋮ Rudimentary Languages and Second‐Order Logic ⋮ Sorting, linear time and the satisfiability problem
This page was built for publication: