94 citations · 376 across the 55 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
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…
cs.CC2012★ 3 cited
One-counter verifiers for decidable languages
Abuzer Yakaryilmaz
Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier…
cs.CC2012★ 5 cited
Turing-equivalent automata using a fixed-size quantum memory
Abuzer Yakaryilmaz
In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtain…