scientific article; zbMATH DE number 3446413
From MaRDI portal
Publication:4770482
zbMATH Open0284.68041MaRDI QIDQ4770482FDOQ4770482
Authors: K. Mehlhorn 
Publication date: 1974
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (9)
- Nondiamond theorems for polynomial time reducibility
- Computational depth and reducibility
- Polynomial and abstract subrecursive classes
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
- Almost everywhere high nonuniform complexity
- Equivalence of measures of complexity classes
- Effective category and measure in abstract complexity theory
- An upward measure separation theorem
- Pseudorandom sources for BPP
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 Q4770482)
