Paper 2024/462 , University of Cambridge , University of Cambridge , University of Warwick, New York University We construct perfect zero-knowledge probabilistically checkable proofs (PZK-PCPs) for every language in #P. This is the first construction of a PZK-PCP for any language outside BPP.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Tom
Contact Tom, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack