Search results

  1. 1.
    0561963 - MÚ 2023 RIV HU eng J - Journal Article
    Pudlák, Pavel - Rödl, V.
    Extractors for small zero-fixing sources.
    Combinatorica. Roč. 42, č. 4 (2022), s. 587-616. ISSN 0209-9683. E-ISSN 1439-6912
    R&D Projects: GA ČR(CZ) GX19-27871X
    Institutional support: RVO:67985840
    Keywords : deterministic extracors * graphs
    OECD category: Pure mathematics
    Impact factor: 1.1, year: 2022
    Method of publishing: Limited access
    https://doi.org/10.1007/s00493-020-4626-7
    Permanent Link: https://hdl.handle.net/11104/0334398
    FileDownloadSizeCommentaryVersionAccess
    Pudlak1.pdf2528.8 KBPublisher’s postprintrequire
     
     
  2. 2.
    0551098 - MÚ 2022 RIV DE eng J - Journal Article
    Koucký, M. - Rödl, V. - Talebanfard, Navid
    A separator theorem for hypergraphs and a CSP-SAT algorithm.
    Logical Methods in Computer Science. Roč. 17, č. 4 (2021), č. článku 17. ISSN 1860-5974. E-ISSN 1860-5974
    R&D Projects: GA ČR(CZ) GX19-27871X
    Institutional support: RVO:67985840
    Keywords : computational complexity * logic in computer science * computer science
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.591, year: 2021
    Method of publishing: Open access
    https://doi.org/10.46298/lmcs-17(4:17)2021
    Permanent Link: http://hdl.handle.net/11104/0326454
    FileDownloadSizeCommentaryVersionAccess
    Talebanfard.pdf5403.2 KBPublisher’s postprintopen-access
     
     
  3. 3.
    0474390 - MÚ 2018 RIV HU eng J - Journal Article
    Lauria, M. - Pudlák, Pavel - Rödl, V. - Thapen, Neil
    The complexity of proving that a graph is Ramsey.
    Combinatorica. Roč. 37, č. 2 (2017), s. 253-268. ISSN 0209-9683. E-ISSN 1439-6912
    R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : complexity * c-Ramsey graphs
    OECD category: Pure mathematics
    Impact factor: 1.406, year: 2017
    http://link.springer.com/article/10.1007%2Fs00493-015-3193-9
    Permanent Link: http://hdl.handle.net/11104/0271451
    FileDownloadSizeCommentaryVersionAccess
    Pudlak1.pdf7433.6 KBPublisher’s postprintrequire
     
     
  4. 4.
    0323440 - MÚ 2009 RIV NL eng J - Journal Article
    Müller, Vladimír - Nešetřil, J. - Rödl, V.
    Some recollections on early work with Jan Pelant.
    [Několik vzpomínek na dřívější práci s Janem Pelantem.]
    Topology and its Applications. Roč. 156, č. 7 (2009), s. 1438-1443. ISSN 0166-8641. E-ISSN 1879-3207
    R&D Projects: GA ČR(CZ) GA201/06/0128
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : Ramsey topological spaces * point character of uniform spaces * tournaments
    Subject RIV: BA - General Mathematics
    Impact factor: 0.441, year: 2009
    Permanent Link: http://hdl.handle.net/11104/0171398
    FileDownloadSizeCommentaryVersionAccess
    Muller3.pdf1149.9 KBPublisher’s postprintrequire
     
     
  5. 5.
    0174430 - MU-W 970026 RIV US eng J - Journal Article
    Pudlák, Pavel - Rödl, V. - Sgall, Jiří
    Boolean Circuits, Tensor Ranks and Communication Complexity.
    Siam Journal on Computing. Roč. 26, č. 3 (1997), s. 605-633. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA AV ČR IAA119107
    Grant - others:US-CS Science and Technology Program 93025
    Source of funding: US
    Permanent Link: http://hdl.handle.net/11104/0071438
    FileDownloadSizeCommentaryVersionAccess
    Pudlak3.pdf1537.6 KBPublisher’s postprintrequire
     
     
  6. 6.
    0085063 - ÚI 2009 DE eng J - Journal Article
    Pudlák, Pavel - Savický, Petr - Rödl, V.
    Graph complexity.
    Acta Informatica. Roč. 25 (1988), s. 515-535. ISSN 0001-5903. E-ISSN 1432-0525
    Permanent Link: http://hdl.handle.net/11104/0147652
     
     


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