ACM Symposium on Theory of Computing, STOC 2018


Article Details
Title: Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
Article URLs:
Alternative Article URLs:
Authors: Cody Murray
  • MIT
R. Ryan Williams
  • MIT
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1552651
DBLP Key: conf/stoc/MurrayW18
Author Comments:

Discuss this paper and its artifacts below