2018/07/12 by Maksims Dimitrijevs, Dimitrijevs, Maksims, Abuzer Yakaryılmaz +1
Computer Science · Biochemistry, Genetics and Molecular Biology · #Cryptography and Data Security #DNA and Biological Computing #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1807.04735
We present three protocols for verifying all languages: (i) For any unary (binary) language, there is a log-space (linear-space) interactive proof system (IPS); (ii) for any language, there is a constant-space weak-IPS (the non-members may not be rejected with high probability); and, (iii) for any language, there is a constant-space IPS with two provers where the verifier reads the input once. Additionally, we show that uncountably many binary (unary) languages can be verified in constant space and in linear (quadratic) expected time.