Basket

    1.
    0574198 - MÚ 2024 RIV US eng J - Journal Article
    Folwarczný, Lukáš
    On protocols for monotone feasible interpolation.
    ACM Transactions on Computation Theory. Roč. 15, 1-2 (2023), č. článku 2. ISSN 1942-3454
    Institutional support: RVO:67985840
    Keywords : circuit complexity * communication complexity * proof complexity
    OECD category: Pure mathematics
    Impact factor: 0.7, year: 2022
    Method of publishing: Limited access
    https://doi.org/10.1145/3583754
    Permanent Link: https://hdl.handle.net/11104/0344548
    FileDownloadSizeCommentaryVersionAccess
    Folwarczny1.pdf1492.8 KBPublisher’s postprintrequire
     
     

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

Accept allSettingsReject all