2 papers
cs.CC2026
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries
Hanlin Ren, Ryan Williams
We prove a near-maximum () circuit lower bound for the complexity class , corresponding to exponential time with access to a promis…
cs.CC2025
Polynomial-Time Pseudodeterministic Construction of Primes
Lijie Chen, Zhenjian Lu, Igor C. Oliveira +2
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on…