Browsing by Issue Date

Browsing by Issue Date

Sort by: Order: Results:

  • Allender, Eric; Das, Bireswar (Elsevier, 2017-10)
    We show that every problem in the complexity class (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (). In particular Graph Isomorphism lies in . This is the first theorem ...

Search Digital Repository


Browse

My Account