Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > RAZBOROV:
Reports tagged with Razborov:
TR10-054 | 30th March 2010
Jan Krajicek

#### On the proof complexity of the Nisan-Wigderson generator based on a hard $NP \cap coNP$ function

Let $g$ be a map defined as the Nisan-Wigderson generator
but based on an $NP \cap coNP$-function $f$. Any string $b$ outside the range of
$g$ determines a propositional tautology $\tau(g)_b$ expressing this
fact. Razborov \cite{Raz03} has conjectured that if $f$ is hard on average for
P/poly then these ... more >>>

ISSN 1433-8092 | Imprint