Skip To Main Content
Sophus Valentin Willumsgaard on Muck Rack

Sophus Valentin Willumsgaard

As seen in: arXiv
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 Sophus Valentin

Contact Sophus Valentin, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

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

Articles

Computer Science > Computational Complexity

|
By Amik Raj Behera, Srikanth Srinivasan, Sophus Valentin Willumsgaard
| arXiv
We give the simplest known algebraic proof of the PCP theorem, involving only ingredients like code concatenation, polynomial interpolation, and polynomial multiplication. Specifically, we prove that graph 3-coloring has a polynomial-sized proof that can be verified by a verifier tossing logarithmically many coins and querying a constant number of bits in the proof.
Open in Who Shared Issue with article?
See all 1 articles