Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP

Saved in:
Bibliographic Details
Published inProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
Format Conference Proceeding
LanguageEnglish
Online AccessGet full text
DOI10.1145/3188745.3188910

Cover

More Information
DOI:10.1145/3188745.3188910