scientific article; zbMATH DE number 2019636
From MaRDI portal
Publication:4440439
zbMath1028.68225MaRDI QIDQ4440439
Publication date: 17 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830209.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Related Items (9)
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions ⋮ Worst-Case to Average-Case Reductions for Subclasses of P ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Unnamed Item ⋮ Pseudorandom generators, typically-correct derandomization, and circuit lower bounds ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ On uniformity and circuit lower bounds ⋮ On the Average-Case Complexity of Property Testing ⋮ Typically-correct derandomization for small time and space
This page was built for publication:
