scientific article; zbMATH DE number 1956513
From MaRDI portal
Publication:4417859
zbMath1029.68056MaRDI QIDQ4417859
Paulin Jacobé de Naurois, Jean-Yves Marion, Felipe Cucker, Olivier Bournez
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2620/26200185.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items
Simulation of simultaneous safe recursion over an arbitrary structure ⋮ Computation over algebraic structures and a classification of undecidable problems ⋮ Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ A hypercomputational alien ⋮ Primitive recursion in the abstract ⋮ Decision Problems for Finite Automata over Infinite Algebraic Structures ⋮ There is no safe pairing function over an arbitrary structure ⋮ Causal computational complexity of distributed processes
This page was built for publication: