Search results

  1. 1.
    0369986 - MÚ 2012 RIV GB eng J - Journal Article
    Alon, N. - Avin, Ch. - Koucký, Michal - Kozma, G. - Lotker, Z. - Tuttle, M.R.
    Many random walks are faster than one.
    Combinatorics Probability & Computing. Roč. 20, č. 4 (2011), s. 481-502. ISSN 0963-5483. E-ISSN 1469-2163
    R&D Projects: GA ČR GP201/07/P276; GA ČR GA201/05/0124
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : multiple random walks * parallel random walks
    Subject RIV: BA - General Mathematics
    Impact factor: 0.778, year: 2011
    http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8280727
    Permanent Link: http://hdl.handle.net/11104/0203914
    FileDownloadSizeCommentaryVersionAccess
    Koucky1.pdf2300.4 KBAuthor’s postprintrequire
     
     
  2. 2.
    0352519 - MÚ 2011 RIV US eng J - Journal Article
    Buhrman, H. - Fortnow, L. - Koucký, Michal - Rogers, J.D. - Vereshchagin, N.K.
    Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
    Theory of Computing Systems. Roč. 46, č. 1 (2010), s. 143-156. ISSN 1432-4350. E-ISSN 1433-0490.
    [2nd International Computer Science Symposium in Russia (CSR 2007). Ekaterinburg, 03.09.2007-07.09.2007]
    R&D Projects: GA ČR GP201/07/P276; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : one-way functions * polynomial hierarchy * Kolmogorov generic oracles
    Subject RIV: BA - General Mathematics
    Impact factor: 0.600, year: 2010
    http://link.springer.com/article/10.1007%2Fs00224-008-9160-8
    Permanent Link: http://hdl.handle.net/11104/0192010
    FileDownloadSizeCommentaryVersionAccess
    Koucky2.pdf1382.5 KBPublisher’s postprintrequire
     
     
  3. 3.
    0336039 - MÚ 2010 RIV US eng J - Journal Article
    Koucký, Michal
    Circuit complexity of regular languages.
    Theory of Computing Systems. Roč. 45, č. 4 (2009), s. 865-879. ISSN 1432-4350. E-ISSN 1433-0490
    R&D Projects: GA ČR GP201/07/P276; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : regular languages * circuit complexity * upper and lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.726, year: 2009
    Permanent Link: http://hdl.handle.net/11104/0180367
    FileDownloadSizeCommentaryVersionAccess
    Koucky2.pdf1323.5 KBPublisher’s postprintrequire
     
     
  4. 4.
    0318538 - MÚ 2009 RIV US eng J - Journal Article
    Gál, A. - Koucký, Michal - McKenzie, P.
    Incremental Branching Programs.
    [Inkrementální rozhodovací programy.]
    Theory of Computing Systems. Roč. 43, č. 2 (2008), s. 159-184. ISSN 1432-4350. E-ISSN 1433-0490
    R&D Projects: GA ČR GP201/07/P276; GA ČR GA201/05/0124
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : branching programs * models of computation * lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.766, year: 2008
    Permanent Link: http://hdl.handle.net/11104/0167927
    FileDownloadSizeCommentaryVersionAccess
    Koucky4.pdf1444.2 KBPublisher’s postprintrequire
     
     


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