scientific article; zbMATH DE number 1335877

zbMATH Open0935.68034MaRDI QIDQ4258568FDOQ4258568

Authors: Oded Goldreich, Madhu Sudan 

Publication date: 13 September 1999

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

Recommendations

• Computational indistinguishability: A sample hierarchy
• Computational indistinguishability: algorithms vs. circuits
• scientific article; zbMATH DE number 1301087
• Distinguishing two probability ensembles with one sample from each ensemble

zbMATH Keywords

computational indistinguishability

Mathematics Subject Classification ID

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

Cited In (9)

• Sublinear bounds on the distinguishing advantage for multiple samples
• Computational indistinguishability: A sample hierarchy
• On equivalences, metrics, and polynomial time
• Title not available (Why is that?)
• Outcome indistinguishability
• A note on computational indistinguishability
• Distinguishing two probability ensembles with one sample from each ensemble
• A tight computational indistinguishability bound for product distributions
• From absolute distinguishability to positive distinguishability

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 Q4258568)