scientific article; zbMATH DE number 1956513
From MaRDI portal
Publication:4417859
Recommendations
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
- Safe recursion over an arbitrary structure: PAR, PH and DPH
- Implicit complexity over an arbitrary structure: Quantifier alternations
- scientific article; zbMATH DE number 2163035
- Function-algebraic characterizations of log and polylog parallel time
Cited in
(19)- Function-algebraic characterizations of log and polylog parallel time
- Multiple permitting and array noncomputability
- Characterizations of ITBM-computability. II
- Causal computational complexity of distributed processes
- Structures computable in polynomial time. I
- Implicit complexity over an arbitrary structure: Quantifier alternations
- A hypercomputational alien
- Decision Problems for Finite Automata over Infinite Algebraic Structures
- Computation over algebraic structures and a classification of undecidable problems
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
- scientific article; zbMATH DE number 2163035 (Why is no real title available?)
- Safe recursion over an arbitrary structure: PAR, PH and DPH
- Primitive recursion in the abstract
- There is no safe pairing function over an arbitrary structure
- Quantifiying the robustness of dynamical systems. Relating time and space to length and precision
- The complexity of computing in continuous time: space complexity is precision
- Quantifying the robustness of dynamical systems. Relating time and space to length and precision
- Simulation of simultaneous safe recursion over an arbitrary structure
- On invariance of degree for certain computations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417859)
