scientific article; zbMATH DE number 4160709

zbMATH Open0707.03033MaRDI QIDQ3487328FDOQ3487328

Theodore A. Slaman, Wolfgang Maass

Publication date: 1990

Title of this publication is not available (Why is that?)

zbMATH Keywords

reductionTuring degreespolynomial time degreescomplexity classconstructive Cohen forcingfine structure of Ppriority methods

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursively (computably) enumerable sets and degrees (03D25) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (1)

• On the Relations Between Discrete and Continuous Complexity Theory

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 Q3487328)