Math Conjectures
HomeReferencesMurrayWilliams2017MCSP

MurrayWilliams2017MCSP

On the (non) NP-hardness of computing circuit complexity

Cody D. Murray and R. Ryan Williams

misc2017
Citation key
MurrayWilliams2017MCSP
Year
2017
Cited by
1 catalog records
Direct source
Available

Reference note

Why this source is in the ledger

Cody D. Murray and R. Ryan Williams, “On the (non) NP-hardness of computing circuit complexity,” Theory of Computing 13 (2017), Article 4, DOI: 10.4086/toc.2017.v013a004.

Catalog connections

Conjectures citing this source

Source record

Bibliographic fields

Inspect the parsed BibTeX fields
author
Cody D. Murray and R. Ryan Williams
doi
10.4086/toc.2017.v013a004
note
Cody D. Murray and R. Ryan Williams, “On the (non) NP-hardness of computing circuit complexity,” Theory of Computing 13 (2017), Article 4, DOI: 10.4086/toc.2017.v013a004.
title
On the (non) NP-hardness of computing circuit complexity
year
2017