More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit ..."

Magnus Gausdal Find et al. (2016)

> Home

Details and statistics

DOI: 10.1109/FOCS.2016.19

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/FindGHK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/FindGHK16
Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. FOCS 2016: 89-98

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.