Number of the records: 1  

The Layer complexity of Arthur-Merlin-like communication

  1. 1.
    SYSNO0546785
    TitleThe Layer complexity of Arthur-Merlin-like communication
    Author(s) Gavinsky, Dmitry (MU-W) RID, SAI, ORCID
    Corespondence/seniorGavinsky, Dmitry - Korespondující autor
    Source Title Theory of Computing. Roč. 17, č. 1 (2021). - : University of Chicago
    Article number8
    Document TypeČlánek v odborném periodiku
    Grant GX19-27871X GA ČR - Czech Science Foundation (CSF), CZ - Czech Republic
    Institutional supportMU-W - RVO:67985840
    Languageeng
    CountryUS
    Keywords communication complexity * complexity classes
    URLhttp://dx.doi.org/10.4086/toc.2021.v017a008
    Permanent Linkhttp://hdl.handle.net/11104/0323166
    FileDownloadSizeCommentaryVersionAccess
    Gavinsky1.pdf2321.6 KBPublisher’s postprintopen-access
     
Number of the records: 1  

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