scientific article
From MaRDI portal
Publication:3835449
zbMATH Open0679.03015MaRDI QIDQ3835449
Theodore A. Slaman, Wolfgang Maass
Publication date: 1989
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (4)
Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Classes of computable functions defined by bounds on computation ⋮ The Veblen functions for computability theorists
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 Q3835449)