scientific article; zbMATH DE number 5041649
From MaRDI portal
Publication:5476780
zbMath1096.03046MaRDI QIDQ5476780
Publication date: 18 July 2006
Full work available at URL: https://eudml.org/doc/52661
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Abstract and axiomatic computability and recursion theory (03D75)
This page was built for publication: