scientific article; zbMATH DE number 2133317

zbMATH Open1106.68048MaRDI QIDQ4650347FDOQ4650347

Authors: Marius Zimand 

Publication date: 11 February 2005

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

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

quantum computationresource-bounded measurehardness amplificationprobabilistically checkable proofspseudo-random generatorsaverage-complexity

Mathematics Subject Classification ID

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

Cited In (9)

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

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)