Strong co-nondeterministic lower bounds for NP cannot be proved feasibly

Ján Pich, Rahul Santhanam. Strong co-nondeterministic lower bounds for NP cannot be proved feasibly. In Samir Khuller, Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. pages 223-233, ACM, 2021. [doi]

Abstract

Abstract is missing.