Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Lukáš Folwarczný"'
Autor:
Lukáš Folwarczný
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof complexity lower
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31d6e91b914f09c51eae025736d3eb9c
http://arxiv.org/abs/2201.05662
http://arxiv.org/abs/2201.05662
Autor:
Marek Chrobak, Łukasz Jeż, Nguyen Kim Thang, Martin Böhm, Pavel Veselý, Jiří Sgall, Christoph Dürr, Jaroslaw Byrka, Marcin Bienkowski, Lukáš Folwarczný
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133--143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133--143. ⟨10.1016/j.tcs.2021.02.016⟩
In the Multi-Level Aggregation Problem ( MLAP ), requests for service arrive at the nodes of an edge-weighted rooted tree T . Each service is represented by a subtree X of T that contains its root. This subtree X serves all requests that are pending
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0186c04d6bcce26ca5e147e16ac11595
https://hal.archives-ouvertes.fr/hal-03377715
https://hal.archives-ouvertes.fr/hal-03377715
Autor:
Lukáš Folwarczný, Dušan Knop
Publikováno v:
Information Processing Letters. 125:5-8
IV -matching is a generalization of perfect bipartite matching. The complexity of finding IV -matching in a graph was posted as an open problem in [Fiala, Klavik, Kratochvil, Nedela, ICALP 2014]. It was shown that if it is possible to find an IV -mat
Autor:
Jiří Sgall, Jaroslaw Byrka, Lukáš Folwarczný, Nguyen Kim Thang, Marek Chrobak, Łukasz Jeż, Christoph Dürr, Martin Böhm, Pavel Veselý, Marcin Bienkowski
Publikováno v:
Proc. of the 24th European Symposium on Algorithms (ESA)
The 24th European Symposium on Algorithms (ESA)
The 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark
Operations Research
Operations Research, INFORMS, 2020, 68 (1), pp.214--232. ⟨10.1287/opre.2019.1847⟩
Operations Research, 2020, 68 (1), pp.214--232. ⟨10.1287/opre.2019.1847⟩
The 24th European Symposium on Algorithms (ESA)
The 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark
Operations Research
Operations Research, INFORMS, 2020, 68 (1), pp.214--232. ⟨10.1287/opre.2019.1847⟩
Operations Research, 2020, 68 (1), pp.214--232. ⟨10.1287/opre.2019.1847⟩
In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edge-weighted tree T, and have to be served eventually. A service is defined as a subtree X of T that contains its root. This subtree X serves all requests that are pen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d580a18464274ff76e216efdb414e3bc
https://hal.archives-ouvertes.fr/hal-01344102
https://hal.archives-ouvertes.fr/hal-01344102
Autor:
Jiří Sgall, Lukáš Folwarczný
Caching (also known as paging) is a classical problem concerning page replacement policies in two-level memory systems. General caching is the variant with pages of different sizes and fault costs. We give the first NP-hardness result for general cac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da633cd4fdf54e5f1ff3c74c864eb681
http://arxiv.org/abs/1506.07905
http://arxiv.org/abs/1506.07905
Autor:
Jiří Sgall, Lukáš Folwarczný
Publikováno v:
Algorithms and Computation ISBN: 9783662489703
ISAAC
ISAAC
Caching (also known as paging) is a classical problem concerning page replacement policies in two-level memory systems. General caching is the variant with pages of different sizes and fault costs. The strong NP-hardness of its two important cases, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed0a6f9cdafa4f7e76a39a671369d20d
https://doi.org/10.1007/978-3-662-48971-0_11
https://doi.org/10.1007/978-3-662-48971-0_11