Number of the records: 1  

A New Characterization of ACC(0) and Probabilistic CC0

  1. 1.
    SYSNO0352500
    TitleA New Characterization of ACC(0) and Probabilistic CC0
    Author(s) Hansen, A. K. (DK)
    Koucký, Michal (MU-W) RID, SAI, ORCID
    Source Title Computational Complexity. Roč. 19, č. 2 (2010), s. 211-234. - : Springer
    Conference 24th Annual IEEE Conference on Computational Complexity, Paris, 15.07.2009-18.07.2009
    Document TypeČlánek v odborném periodiku
    Grant GAP202/10/0854 GA ČR - Czech Science Foundation (CSF)
    1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
    IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryCH
    Keywords bounded depth circuits * counting circuits * arithmetic circuits * complexity classes
    URLhttp://link.springer.com/article/10.1007%2Fs00037-010-0287-z
    Permanent Linkhttp://hdl.handle.net/11104/0191994
    FileDownloadSizeCommentaryVersionAccess
    Koucky3.pdf1539.5 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.