Number of the records: 1  

Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?

    1.
    SYSNO0352519
    TitleDoes the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
    Author(s) Buhrman, H. (NL)
    Fortnow, L. (US)
    Koucký, Michal (MU-W) RID, SAI, ORCID
    Rogers, J.D. (US)
    Vereshchagin, N.K. (RU)
    Source Title Theory of Computing Systems. Roč. 46, č. 1 (2010), s. 143-156. - : Springer
    Conference 2nd International Computer Science Symposium in Russia (CSR 2007), Ekaterinburg, 03.09.2007-07.09.2007
    Document TypeČlánek v odborném periodiku
    Grant GP201/07/P276 GA ČR - Czech Science Foundation (CSF)
    1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryUS
    Keywords one-way functions * polynomial hierarchy * Kolmogorov generic oracles
    URLhttp://link.springer.com/article/10.1007%2Fs00224-008-9160-8
    Permanent Linkhttp://hdl.handle.net/11104/0192010
    FileDownloadSizeCommentaryVersionAccess
    Koucky2.pdf1382.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.

Accept allSettingsReject all