1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.CC2026★ 1 cited
Real-Time, Constant-Space, Constant-Randomness Verifiers
M. Utkan Gezer, Ãzdeniz Dolu, Nevzat Ersoy +1
We study the class of languages that have membership proofs which can be verified by real-time finite-state machines using only a constant number of random bits, regardless of the…
cs.CC2025
has polynomial-time finite-state verifiers
M. Utkan Gezer, A. C. Cem Say
Interactive proof systems whose verifiers are constant-space machines have interesting features that do not have counterparts in the better studied case where the verifiers operate…
cs.CC2024
Unconditional proofs of quantumness between small-space machines
A. C. Cem Say, M. Utkan Gezer
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a com…