Computational indistinguishability: A sample hierarchy

zbMath0947.68066MaRDI QIDQ1961376

Madhu Sudan, Oded Goldreich

Publication date: 17 January 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

eigenvaluespolynomialsexpandersextractorsrapid mixingcomputational indistinguishability

Mathematics Subject Classification ID

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

Related Items (1)

Distinguishing two probability ensembles with one sample from each ensemble

Cites Work

• Probabilistic encryption
• Computational indistinguishability: algorithms vs. circuits
• The eigenvalues of random symmetric matrices
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational indistinguishability: A sample hierarchy