scientific article; zbMATH DE number 2011858
From MaRDI portal
Publication:4437510
zbMath1032.68168MaRDI QIDQ4437510
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530213.htm
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) Randomized algorithms (68W20) Other degrees and reducibilities in computability and recursion theory (03D30)
This page was built for publication: