The following pages link to (Q4234078):
Displaying 21 items.
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- A survey on real structural complexity theory (Q1280231) (← links)
- Metafinite model theory (Q1383163) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Counting problems over the reals (Q1575534) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Computing over the reals with addition and order: Higher complexity classes (Q1908895) (← links)
- A logical characterization of constant-depth circuits over the reals (Q2148775) (← links)
- On elementary logics for quantitative dependencies (Q2172823) (← links)
- Periodic generalized automata over the reals (Q2280333) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- (Q4002474) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- (Q4941885) (← links)
- DESCRIPTIVE COMPLEXITY IN CANTOR SERIES (Q5100047) (← links)
- Topics in real and complex number complexity theory (Q5501602) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918401) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918795) (← links)
- Metafinite model theory (Q6064289) (← links)
- Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
- Logical characterizations of algebraic circuit classes over integral domains (Q6620024) (← links)
