@inbook{1b8e87a6367a4c6eba05802cc5a6a5c0,
title = "From absolute distinguishability to positive distinguishability",
abstract = "We study methods of converting algorithms that distinguish pairs of distributions with a gap that has an absolute value that is noticeable into corresponding algorithms in which the gap is always positive (and noticeable). Our focus is on designing algorithms that, in addition to the tested string, obtain a fixed number of samples from each distribution. Needless to say, such algorithms can not provide a very reliable guess for the sign of the original distinguishability gap, still we show that even guesses that are noticeably better than random are useful in this setting.",
author = "Zvika Brakerski and Oded Goldreich",
year = "2011",
doi = "10.1007/978-3-642-22670-0\_17",
language = "الإنجليزيّة",
isbn = "9783642226694",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "141--155",
editor = "Oded Goldreich",
booktitle = "Studies in Complexity and Cryptography",
}