Search results

  1. 1.
    0585147 - ÚI 2025 RIV NL eng J - Journal Article
    Acharyya, A. - Keikha, Vahideh - Majumdar, D. - Pandit, S.
    Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms.
    Theoretical Computer Science. Roč. 990, 1 April 2024 (2024), č. článku 114402. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR(CZ) GJ19-06792Y
    Institutional support: RVO:67985807
    Keywords : Constrained geometric hitting set * Computational complexity * Approximation algorithms * Parameterized complexity * Kernelization * Set cover conjecture
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 1.1, year: 2022
    https://doi.org/10.1016/j.tcs.2024.114402
    Permanent Link: https://hdl.handle.net/11104/0352882
     
     
  2. 2.
    0548662 - ÚI 2022 RIV CH eng C - Conference Paper (international conference)
    Acharyya, Ankush - Keikha, Vahideh - Majumdar, D. - Pandit, S.
    Constrained Hitting Set Problem with Intervals.
    Computing and Combinatorics: 27th International Conference, COCOON 2021 Proceedings. Cham: Springer, 2021 - (Chen, C.; Hon, W.; Hung, L.; Lee, C.), s. 604-616. Lecture Notes in Computer Science, 13025. ISBN 978-3-030-89542-6. ISSN 0302-9743.
    [COCOON 2021: International Conference on Computing and Combinatorics /27./. Tainan (TW), 24.10.2021-26.10.2021]
    R&D Projects: GA ČR(CZ) GJ19-06792Y
    Institutional support: RVO:67985807
    Keywords : Fixed Parameter Tractability * Hitting Set Problem * Approximation Algorithm
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Permanent Link: http://hdl.handle.net/11104/0324711
     
     
  3. 3.
    0367350 - ÚI 2022 RIV NL eng J - Journal Article
    Šíma, Jiří - Žák, Stanislav
    A Polynomial-Time Construction of a Hitting Set for Read-once Branching Programs of Width 3.
    Fundamenta Informaticae. Roč. 184, č. 4 (2021), s. 307-354. ISSN 0169-2968. E-ISSN 1875-8681
    R&D Projects: GA ČR GBP202/12/G061; GA ČR GAP202/10/1333
    Institutional support: RVO:67985807
    Keywords : derandomization * hitting set * read-once branching programs * bounded width * almost k-wise independent set
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 1.166, year: 2021
    Method of publishing: Limited access
    http://dx.doi.org/10.3233/FI-2021-2101
    Permanent Link: http://hdl.handle.net/11104/0202062
     
     
  4. 4.
    0364426 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
    Šíma, Jiří - Žák, Stanislav
    A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3.
    SOFSEM 2012. Theory and Practice of Computer Science. Berlin: Springer, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Turán, G.), s. 406-418. Lecture Notes in Computer Science, 7147. ISBN 978-3-642-27659-0. ISSN 0302-9743.
    [SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012]
    R&D Projects: GA ČR GAP202/10/1333; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : derandomization * hitting set * read-once branching programs * bounded width
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0199914
    FileDownloadSizeCommentaryVersionAccess
    a0364426.pdf0320.8 KBPublisher’s postprintrequire
    0364426.pdf1576.4 KBAuthor´s preprintopen-access
     
     
  5. 5.
    0360403 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
    Šíma, Jiří - Žák, Stanislav
    Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs.
    Computer Science - Theory and Applications. Berlin: Springer, 2011 - (Kulikov, A.; Vereshchagin, N.), s. 120-133. Lecture Notes in Computer Science, 6651. ISBN 978-3-642-20711-2. ISSN 0302-9743.
    [CSR 2011. International Computer Science Symposium in Russia /6./. St. Petersburg (RU), 14.06.2011-18.06.2011]
    R&D Projects: GA ČR GAP202/10/1333; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : almost k-wise independent set * hitting set * read-once branching programs * derandomization * bounded width
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0197967
    FileDownloadSizeCommentaryVersionAccess
    a0360403.pdf15331.7 KBPublisher’s postprintrequire
    0360403.pdf0622.5 KBAuthor´s preprintopen-access
     
     
  6. 6.
    0349417 - ÚI 2011 DE eng V - Research Report
    Šíma, Jiří - Žák, Stanislav
    A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3.
    Trier, 2010. 20 s. Electronic Colloquium on Computational Complexity, TR10-088.
    R&D Projects: GA ČR GAP202/10/1333
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : bounded width * derandomization * Hitting Set * read-once branching program
    Subject RIV: IN - Informatics, Computer Science
    http://www.eccc.uni-trier.de/report/2010/088/
    Permanent Link: http://hdl.handle.net/11104/0189664
     
     
  7. 7.
    0331291 - ÚI 2010 CZ eng V - Research Report
    Šíma, Jiří - Žák, Stanislav
    A Characterization of Hitting Sets for 1-Branching Programs of Width 3 (Revised Version).
    Prague: ICS AS CR, 2009. 18 s. Technical Report, V-1054.
    R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : derandomization, hitting set * hitting set * read-once branching programs * bounded width
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0176844
    FileDownloadSizeCommentaryVersionAccess
    v1054-09.pdf16253 KBOtheropen-access
     
     
  8. 8.
    0313794 - ÚI 2009 SIGLE CZ eng V - Research Report
    Šíma, Jiří - Žák, Stanislav
    A Characterization of Hitting Sets for 1 Branching Programs of Width 3.
    Prague: ICS AS CR, 2008. 11 s. Technical Report, V-1029.
    R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR 1ET100300517
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : derandomization, hitting set * branching programs of bounded width
    Subject RIV: IN - Informatics, Computer Science
    Permanent Link: http://hdl.handle.net/11104/0164506
    FileDownloadSizeCommentaryVersionAccess
    v1029-08.pdf0207.8 KBOtherrequire
     
     
  9. 9.
    0031744 - UIVT-O 336078 SIGLE CZ eng V - Research Report
    Savický, Petr - Šíma, Jiří - Žák, Stanislav
    An Explicit Polynomial Size Hitting Set for Restricted 1-Branching Programs Width 3.
    Prague: ICS AS CR, 2005. 8 s. Technical Report, V-953.
    R&D Projects: GA AV ČR(CZ) 1ET100300517; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : derandomization * hitting set * branching programs of bounded width
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0132399
    FileDownloadSizeCommentaryVersionAccess
    v953-06.pdf16267.4 KBOtheropen-access
     
     


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