scientific article

zbMath0455.03018MaRDI QIDQ3902993

Vladimir Yu. Sazonov

Publication date: 1980

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

zbMATH Keywords

polynomial time computable functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (12)

\(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ On feasible numbers ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability ⋮ Computing on structures ⋮ Tailoring recursion for complexity ⋮ Characterizing complexity classes by higher type primitive recursive definitions ⋮ Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH ⋮ Characterizing complexity classes by general recursive definitions in higher types ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ Primitive recursion in the abstract ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ Asymptotic invariants, complexity of groups and related problems

This page was built for publication: