1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2014
Debates with small transparent quantum verifiers
Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We…
cs.CC2012
Checking generalized debates with small space and randomness
H. Gökalp Demirci, A. C. Cem Say
We introduce a model of probabilistic debate checking, where a silent resource-bounded verifier reads a dialogue about the membership of the string in the language under considerat…
cs.CC2012★ 1 cited
Probabilistic verifiers for asymmetric debates
H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryılmaz
We examine the power of silent constant-space probabilistic verifiers that watch asymmetric debates (where one side is unable to see some of the messages of the other) between two…