Search results
- 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
Impact factor: 1.1, year: 2022
https://doi.org/10.1016/j.tcs.2024.114402
Permanent Link: https://hdl.handle.net/11104/0352882 - 2.0562741 - ÚI 2023 RIV NL eng J - Journal Article
Acharyya, Ankush - Jallu, Ramesh Kumar - Keikha, Vahideh - Löffler, M. - Saumell, Maria
Minimum color spanning circle of imprecise points.
Theoretical Computer Science. Roč. 930, September 2022 (2022), s. 116-127. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR(CZ) GJ19-06792Y
EU Projects: European Commission(ES) 734922
Institutional support: RVO:67985807
Keywords : Color spanning circle * Imprecise points * Algorithms * Computational complexity * Colored points
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
Method of publishing: Limited access
https://dx.doi.org/10.1016/j.tcs.2022.07.016
Permanent Link: https://hdl.handle.net/11104/0335586
Research data: ArXiv.org - 3.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/0326454File Download Size Commentary Version Access Talebanfard.pdf 5 403.2 KB Publisher’s postprint open-access - 4.0548659 - ÚI 2022 RIV CH eng C - Conference Paper (international conference)
Acharyya, Ankush - Jallu, Ramesh Kumar - Keikha, Vahideh - Löffler, M. - Saumell, Maria
Minimum Color Spanning Circle in Imprecise Setup.
Computing and Combinatorics: 27th International Conference, COCOON 2021 Proceedings. Cham: Springer, 2021 - (Chen, C.; Hon, W.; Hung, L.; Lee, C.), s. 257-268. 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
EU Projects: European Commission(ES) 734922
Institutional support: RVO:67985807
Keywords : Color spanning circle * Imprecise points * Algorithms * Computational complexity
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/0324709 - 5.0531136 - ÚI 2021 RIV CH eng C - Conference Paper (international conference)
Haniková, Zuzana
On the Complexity of Validity Degrees in Łukasiewicz Logic.
Beyond the Horizon of Computability. Cham: Springer, 2020 - (Anselmo, M.; Della Vedova, G.; Manea, F.; Pauly, A.), s. 175-188. Lecture Notes in Computer Science, 12098. ISBN 978-3-030-51465-5. ISSN 0302-9743.
[CiE 2020: Conference on Computability in Europe /16./. Salerno (IT), 29.06.2020-03.07.2020]
R&D Projects: GA ČR(CZ) GA18-00113S
Institutional support: RVO:67985807
Keywords : Łukasiewicz logic * propositional constants * validity degree * computational complexity * Rational Pavelka Logic
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/0309862File Download Size Commentary Version Access 0531136-a.pdf 2 348.3 KB Author’s postprint require - 6.0524632 - MÚ 2021 RIV NL eng J - Journal Article
Jeřábek, Emil
Rules with parameters in modal logic II.
Annals of Pure and Applied Logic. Roč. 171, č. 10 (2020), č. článku 102829. ISSN 0168-0072. E-ISSN 1873-2461
R&D Projects: GA ČR(CZ) GA19-05497S
Institutional support: RVO:67985840
Keywords : admissible rule * computational complexity * equational unification * modal logic
OECD category: Pure mathematics
Impact factor: 0.678, year: 2020
Method of publishing: Limited access
https://doi.org/10.1016/j.apal.2020.102829
Permanent Link: http://hdl.handle.net/11104/0308973File Download Size Commentary Version Access Jerabek2.pdf 2 1.1 MB Publisher’s postprint require - 7.0524140 - MÚ 2021 RIV GB eng J - Journal Article
Hrubeš, Pavel
On the distribution of runners on a circle.
European Journal of Combinatorics. Roč. 89, October (2020), č. článku 103137. ISSN 0195-6698. E-ISSN 1095-9971
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : computational complexity * distribution of runners on a circle
OECD category: Pure mathematics
Impact factor: 0.847, year: 2020
Method of publishing: Limited access
https://doi.org/10.1016/j.ejc.2020.103137
Permanent Link: http://hdl.handle.net/11104/0308495File Download Size Commentary Version Access Hrubes.pdf 1 376.7 KB Publisher’s postprint require - 8.0523286 - MÚ 2020 RIV US eng C - Conference Paper (international conference)
Pich, Ján - Santhanamz, R.
Why are proof complexity lower bounds hard?
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019). Los Alamitos: IEEE, 2019, s. 1305-1324. Annual IEEE Symposium on Foundations of Computer Science. ISBN 978-1-7281-4952-3. ISSN 0272-5428.
[60th IEEE Annual Symposium on Foundations of Computer Science (FOCS). Baltimore (US), 09.11.2019-12.11.2019]
R&D Projects: GA ČR(CZ) GA19-05497S
Institutional support: RVO:67985840
Keywords : computational complexity * proof complexity * circuit lower bounds
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://ieeexplore.ieee.org/document/8948624
Permanent Link: http://hdl.handle.net/11104/0307653 - 9.0510920 - ÚI 2020 eng V - Research Report
Žák, Stanislav
A Logical Characteristic of Read-Once Branching Programs.
Trier, 2019. 16 s. Electronic Colloquium on Computational Complexity, TR19-150. ISSN 1433-8092
Institutional support: RVO:67985807
Keywords : branching programs * Computational Complexity * logic
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://eccc.weizmann.ac.il/report/2019/150/
Permanent Link: http://hdl.handle.net/11104/0301281File Download Size Commentary Version Access 0510920-aonl.pdf 3 262.2 KB volně online Publisher’s postprint open-access - 10.0506562 - ÚI 2020 CZ eng V - Research Report
Žák, Stanislav
A Logical Characteristic of Read-Once Branching Programs.
Prague: ICS CAS, 2019. 16 s. Technical Report, V-1270.
Institutional support: RVO:67985807
Keywords : branching programs * computational complexity * logic
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/0297795File Download Size Commentary Version Access 0506562-av1.pdf 0 157.8 KB verze 07/2019 Other open-access