Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
We prove that if every problem in NP has nk-size circuits for a fixed constant k, then for every NP-verifier and every yes-instance x of length n for that verifier, the verifier's search space has an nO(k3)size witness circuit: a witness for x that can be encoded with a circuit of only nO(k3) s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM),
2021-04-28T17:29:38Z.
|
| Subjects: | |
| Online Access: | Get fulltext |