scientific article; zbMATH DE number 2133317

zbMath1106.68048MaRDI QIDQ4650347

Marius Zimand

Publication date: 11 February 2005

Full work available at URL: http://www.sciencedirect.com/science/book/9780444828415

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

zbMATH Keywords

quantum computationhardness amplificationprobabilistically checkable proofsresource-bounded measurepseudo-random generatorsaverage-complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Data encryption (aspects in computer science) (68P25) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Quantum one-way permutation over the finite field of two elements ⋮ BOX-COUNTING DIMENSION COMPUTED BY α-DENSE CURVES ⋮ Dimension and the structure of complexity classes ⋮ Algorithmically independent sequences ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences