| Title: |
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Magnus Gausdal Find |
-
National Institute of Standards and Technology
|
| Alexander Golovnev |
-
New York University
-
Russian Academy of Sciences, Steklov Institute of Mathematics at St. Petersburg
|
| Edward A. Hirsch |
-
Russian Academy of Sciences, Steklov Institute of Mathematics at St. Petersburg
|
| Alexander S. Kulikov |
-
Russian Academy of Sciences, Steklov Institute of Mathematics at St. Petersburg
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1319051
|
| DBLP Key: |
conf/focs/FindGHK16
|
| Author Comments: |
|