Search results

  1. 1.
    0507214 - ÚI 2020 eng V - Research Report
    Pich, Ján - Müller, M.
    Feasibly constructive proofs of succinct weak circuit lower bounds.
    Trier, 2017. Electronic Colloquium on Computational Complexity, TR17-144. ISSN 1433-8092
    https://eccc.weizmann.ac.il/report/2017/144/
    Permanent Link: http://hdl.handle.net/11104/0298255
     
     


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