scientific article

From MaRDI portal

Publication:3032239

Jump to:navigation, search

zbMath0691.03025MaRDI QIDQ3032239

Theodore A. Slaman

Publication date: 1989

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

zbMATH Keywords

polynomial time Turing reductions recursive sets ordered by time bounded Turing reducibility

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3032239&oldid=16073447"