30 citations · 37 across the 6 of their papers we have counts for
1 paper · 1 filter
Alex B. Grilo, Philippe Lamontagne
The round complexity of interactive proof systems is a key question of practical and theoretical relevance in complexity theory and cryptography. Moreover, results such as QIP = QI…