Natural Proofs versus Derandomization
Work
Year: 2016
Type: article
Abstract: We study connections between the Natural Proofs of Razborov and Rudich, derandomization, and the problem of proving "weak" circuit lower bounds such as ${\sf NEXP} \not\subset {\sf TC}^0$, which are s... more
Source: SIAM Journal on Computing
Author Ryan Williams
Institution Stanford University
Cites: 21
Cited by: 26
Related to: 10
FWCI: 3.167
Citation percentile (by year/subfield): 94.55
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Grant IDS DMS-1049268, CCF-1212372