Search results

  1. 1.
    0479819 - ÚI 2018 US eng J - Journal Article
    Čadek, M. - Krčál, Marek - Matoušek, J. - Vokřínek, L. - Wagner, U.
    Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension.
    Siam Journal on Computing. Roč. 43, č. 5 (2014), s. 1728-1780. ISSN 0097-5397. E-ISSN 1095-7111
    Keywords : algebraic-topology * computability * maps * algebraic topology * homotopy theory * homotopy groups * Postnikov systems * computational complexity
    Impact factor: 0.741, year: 2014
    Permanent Link: http://hdl.handle.net/11104/0275746
     
     
  2. 2.
    0478998 - ÚI 2018 RIV US eng J - Journal Article
    Cabello, S. - Cibulka, J. - Kynčl, J. - Saumell, Maria - Valtr, P.
    Peeling Potatoes Near-optimally in Near-linear Time.
    Siam Journal on Computing. Roč. 46, č. 5 (2017), s. 1574-1602. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA ČR GBP202/12/G061
    Grant - others:GA MŠk(CZ) LO1506; GA MŠk(CZ) EE2.3.30.0038
    Institutional support: RVO:67985807
    Keywords : geometric optimization * potato peeling * visibility graph * geometric probability * approximation algorithm
    OECD category: Pure mathematics
    Impact factor: 0.902, year: 2017
    Permanent Link: http://hdl.handle.net/11104/0275024
    FileDownloadSizeCommentaryVersionAccess
    a0478998.pdf14341.8 KBPublisher’s postprintrequire
     
     
  3. 3.
    0473043 - MÚ 2018 RIV US eng J - Journal Article
    Gavinsky, Dmitry - Meir, O. - Weinstein, O. - Wigderson, A.
    Toward better formula lower bounds: The composition of a function and a universal relation.
    Siam Journal on Computing. Roč. 46, č. 1 (2017), s. 114-131. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : formula * Karchmer-Wigderson relations * lower bounds
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.902, year: 2017
    http://epubs.siam.org/doi/10.1137/15M1018319
    Permanent Link: http://hdl.handle.net/11104/0270211
    FileDownloadSizeCommentaryVersionAccess
    Gavinsky.pdf6229.7 KBPublisher’s postprintrequire
     
     
  4. 4.
    0466751 - MÚ 2017 RIV US eng J - Journal Article
    Bonacina, I. - Galesi, N. - Thapen, Neil
    Total space in resolution.
    Siam Journal on Computing. Roč. 45, č. 5 (2016), s. 1894-1909. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA ČR GBP202/12/G061
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : total space * resolution random CNFs * proof complexity
    Subject RIV: BA - General Mathematics
    Impact factor: 1.433, year: 2016
    http://epubs.siam.org/doi/10.1137/15M1023269
    Permanent Link: http://hdl.handle.net/11104/0264987
    FileDownloadSizeCommentaryVersionAccess
    Thapen2.pdf8493.9 KBPublisher’s postprintrequire
     
     
  5. 5.
    0447629 - MÚ 2016 RIV US eng J - Journal Article
    Filmus, Y. - Lauria, M. - Nordström, J. - Ron-Zewi, N. - Thapen, Neil
    Space complexity in polynomial calculus.
    Siam Journal on Computing. Roč. 44, č. 4 (2015), s. 1119-1153. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : proof complexity * polynomial calculus * lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.841, year: 2015
    http://epubs.siam.org/doi/10.1137/120895950
    Permanent Link: http://hdl.handle.net/11104/0249428
    FileDownloadSizeCommentaryVersionAccess
    Thapen.pdf2439.5 KBPublisher’s postprintrequire
     
     
  6. 6.
    0443869 - MÚ 2016 RIV US eng J - Journal Article
    Hrubeš, Pavel - Tzameret, I.
    Short proofs for the determinant identities.
    Siam Journal on Computing. Roč. 44, č. 2 (2015), s. 340-383. ISSN 0097-5397. E-ISSN 1095-7111
    EU Projects: European Commission(XE) 339691 - FEALORA
    Program: FP7
    Institutional support: RVO:67985840
    Keywords : proof complexity * arithmetic circuits
    Subject RIV: BA - General Mathematics
    Impact factor: 0.841, year: 2015
    http://epubs.siam.org/doi/abs/10.1137/130917788
    Permanent Link: http://hdl.handle.net/11104/0246543
    FileDownloadSizeCommentaryVersionAccess
    Hrubes.pdf10430.7 KBPublisher’s postprintrequire
     
     
  7. 7.
    0402598 - UIVT-O 981037 US eng J - Journal Article
    Kratochvíl, J. - Savický, Petr - Tuza, Z.
    One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete.
    Siam Journal on Computing. Roč. 22, č. 1 (1993), s. 203-210. ISSN 0097-5397. E-ISSN 1095-7111
    Keywords : satisfiability * Boolean formula * conjuctive normal form * NP-completeness
    Permanent Link: http://hdl.handle.net/11104/0122996
     
     
  8. 8.
    0175115 - MU-W 20025166 RIV US eng J - Journal Article
    Berkman, O. - Parnas, M. - Sgall, Jiří
    Efficient dynamic traitor tracing.
    Siam Journal on Computing. Roč. 30, č. 6 (2001), s. 1802-1828. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA AV ČR IAA1019901; GA ČR GA201/97/P038
    Keywords : cryptography%online algorithms
    Subject RIV: BA - General Mathematics
    Impact factor: 0.655, year: 2001
    Permanent Link: http://hdl.handle.net/11104/0072104
    FileDownloadSizeCommentaryVersionAccess
    Sgall2.pdf1250.9 KBPublisher’s postprintrequire
     
     
  9. 9.
    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
     
     
  10. 10.
    0096123 - MÚ 2008 RIV US eng J - Journal Article
    Chrobák, M. - Jawor, W. - Sgall, Jiří - Tichý, Tomáš
    Online scheduling of equal-length jobs: Randomization and restarts help.
    [Online rozvrhování úloh stejné délky: Náhodnost a restarty pomáhají.]
    Siam Journal on Computing. Roč. 36, č. 6 (2007), s. 1709-1728. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : online algorithms * scheduling
    Subject RIV: BA - General Mathematics
    Impact factor: 1.310, year: 2007
    Permanent Link: http://hdl.handle.net/11104/0155562
    FileDownloadSizeCommentaryVersionAccess
    Sgall2.pdf1363.8 KBPublisher’s postprintrequire
     
     

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