scientific article; zbMATH DE number 3446413
From MaRDI portal
zbMath0284.68041MaRDI QIDQ4770482
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items
Computational depth and reducibility, Equivalence of measures of complexity classes, Pseudorandom sources for BPP, Almost everywhere high nonuniform complexity, The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory, Nondiamond theorems for polynomial time reducibility, Effective category and measure in abstract complexity theory, Polynomial and abstract subrecursive classes, An upward measure separation theorem
