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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ján Pich' in GoogleThis author has not been identified. Look up 'Rahul Santhanam' in Google

runs on WebDSL