Property testing and interactive proofs sit at the confluence of theoretical computer science and practical algorithm design. Property testing is a sublinear framework that allows one to quickly ...

Computational complexity and proof systems constitute a cornerstone of theoretical computer science, addressing both the inherent difficulty of algorithmic problems and the efficiency of formal ...

Zk-SNARK, which stands for zero-knowledge succinct non-interactive argument or knowledge, is the most popular zero-knowledge protocol. This a space of increasing importance, as zero knowledge systems ...