scientific article; zbMATH DE number 4121422
From MaRDI portal
Publication:4734760
zbMath0684.68045MaRDI QIDQ4734760
Ambos-Spies, Klaus, Hans Fleischhack, Hagen Huwig
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Genericity and measure for exponential time ⋮ Index sets and presentations of complexity classes ⋮ Resource bounded randomness and weakly complete problems ⋮ Immunity and pseudorandomness of context-free languages ⋮ Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998 ⋮ Genericity and randomness over feasible probability measures ⋮ Genericity and measure for exponential time ⋮ Resource bounded immunity and simplicity ⋮ Resource-bounded martingales and computable Dowd-type generic sets ⋮ Feasible analysis, randomness, and base invariance
