scientific article; zbMATH DE number 2133317

MaRDI QIDQ4650347zbMATH OpenFDO

Authors Marius Zimand

Publication date 11 February 2005

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

zbMATH Keywords

average-complexityhardness amplificationprobabilistically checkable proofspseudo-random generatorsquantum computationresource-bounded measure

Mathematics Subject Classification ID

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

Recommendations

• Computational Complexity
• Computational Complexity
• Mathematics and computation. A theory revolutionizing technology and science
• scientific article; zbMATH DE number 5081744
• Complexity theory

Cited in

(9)

• Quantum one-way permutation over the finite field of two elements
• Simple extractors via constructions of cryptographic pseudo-random generators
• Mathematics and computation. A theory revolutionizing technology and science
• Box-counting dimension computed by {\(\alpha\)}-dense curves
• Structure vs combinatorics in computational complexity
• Computational Complexity
• Computational Complexity
• Dimension and the structure of complexity classes
• Algorithmically independent sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650347)