research
∙
06/26/2019
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland
Consider the following two fundamental open problems in complexity theor...
share
research
∙
12/04/2018
