scientific article; zbMATH DE number 1857655

zbMath1048.68128MaRDI QIDQ4788614

Peter Bro Miltersen

Publication date: 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomized algorithmRabin primality test

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)

Related Items (7)

Paradigms for Unconditional Pseudorandom Generators ⋮ On derandomization and average-case complexity of monotone functions ⋮ Pseudorandom generators, typically-correct derandomization, and circuit lower bounds ⋮ Low-depth witnesses are easy to find ⋮ Weak derandomization of weak algorithms: explicit versions of Yao's lemma ⋮ On the Optimal Compression of Sets in PSPACE ⋮ On optimal language compression for sets in PSPACE/poly

This page was built for publication: