94 citations · 176 across the 26 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023
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.IT2023
Read-once machines and the thermodynamic complexity of Maxwell's demons
Fırat Kıyak, A. C. Cem Say
The thermodynamical costs imposed by computational resource limitations like memory and time have been investigated before. We focus on a new computational limitation, namely, the…