scientific article; zbMATH DE number 2102761
From MaRDI portal
Publication:4818849
zbMath1046.68536MaRDI QIDQ4818849
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Publication date: 24 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
Efficient constructions of Hitting Sets for systems of linear functions ⋮ Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs ⋮ Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form ⋮ On pseudorandomness and resource-bounded measure ⋮ Unnamed Item ⋮ Minimal approximate hitting sets and rule templates ⋮ Randomness vs time: Derandomization under a uniform assumption
This page was built for publication:
