Easiness amplification and uniform circuit lower bounds
© Cody D. Murray and R. Ryan Williams. We present new consequences of the assumption that time-bounded algorithms can be "compressed" with non-uniform circuits. Our main contribution is an "easiness amplification" lemma for circuits. One instantiation of the lemma says: if n1+ϵ-t...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021-11-04T16:23:14Z.
|
| Subjects: | |
| Online Access: | Get fulltext |