scientific article
From MaRDI portal
Publication:3203014
zbMath0716.03038MaRDI QIDQ3203014
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Higher-type and set recursion theory (03D65)
Related Items (3)
Computing on structures ⋮ Characterizing complexity classes by general recursive definitions in higher types ⋮ Hereditarily-finite sets, data bases and polynomial-time computability
This page was built for publication: