"On the (Non) NP-Hardness of Computing Circuit Complexity."

Cody D. Murray, R. Ryan Williams (2017)

> Home

Details and statistics

DOI: 10.4086/TOC.2017.V013A004

access: open

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/MurrayW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/MurrayW17
Cody D. Murray, R. Ryan Williams:
On the (Non) NP-Hardness of Computing Circuit Complexity. Theory Comput. 13(1): 1-22 (2017)

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.