Number of the records: 1  

On hardness of multilinearization, and VNP-completeness in characteristics 2

  1. 1.
    0469668 - MÚ 2017 RIV US eng J - Journal Article
    Hrubeš, Pavel
    On hardness of multilinearization, and VNP-completeness in characteristics 2.
    ACM Transactions on Computation Theory. Roč. 9, č. 1 (2016), č. článku 1. ISSN 1942-3454
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : boolean formula * complexity measure
    Subject RIV: BA - General Mathematics
    http://dl.acm.org/citation.cfm?doid=3007903.2940323
    Permanent Link: http://hdl.handle.net/11104/0267481
    FileDownloadSizeCommentaryVersionAccess
    Hrubes3.pdf3208.9 KBPublisher’s postprintrequire
     
     
Number of the records: 1  

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