scientific article; zbMATH DE number 1263207

zbMath0968.68517MaRDI QIDQ4234078

Klaus Meer, Erich Grädel

Publication date: 27 August 2001

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (12)

A logical characterization of constant-depth circuits over the reals ⋮ On elementary logics for quantitative dependencies ⋮ Metafinite model theory ⋮ Dynamical recognizers: real-time language recognition by analog computers ⋮ Queries with arithmetical constraints ⋮ Metafinite model theory ⋮ Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ Periodic generalized automata over the reals ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Real computations with fake numbers

This page was built for publication: