Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Dolu, Özdeniz"'
Publikováno v:
Lecture Notes in Computer Science vol. 13266 (2022) pp. 212-224
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 size of their inputs. Since any further restriction on the verifiers w
Externí odkaz:
http://arxiv.org/abs/2206.00968
Publikováno v:
In Theoretical Computer Science 17 October 2023 976
