most citedDistinguishing the Knowable from the Unknowable with Language Models

3 citations · 3 across the 1 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2024

Quasi-Linear Size PCPs with Small Soundness from HDX

Mitali Bafna, Dor Minzer, Nikhil Vyas

We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs w…