Number of the records: 1  

On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function

  1. 1.
    Krajíček, Jan
    On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function.
    Journal of Mathematical Logic. Roč. 11, č. 1 (2011), s. 11-27. ISSN 0219-0613. E-ISSN 1793-6691
    Impact factor: 0.500, year: 2011
    http://www.worldscinet.com/jml/11/1101/S0219061311000979.html
    http://hdl.handle.net/11104/0203675
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.