Results 271 to 280 of about 42,360 (298)
Some of the next articles are maybe not open access.
Scheduling and fixed-parameter tractability
Mathematical Programming, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mnich, M., Wiese, A.
openaire +5 more sources
2009
Parameterized complexity is a new theoretical framework that considers, in addition to the overall input size, the effects on computational complexity of a secondary measurement, the parameter. This two-dimensional viewpoint allows a fine-grained complexity analysis that takes structural properties of problem instances into account.
Samer Marko, Szeider Stefan
openaire +1 more source
Parameterized complexity is a new theoretical framework that considers, in addition to the overall input size, the effects on computational complexity of a secondary measurement, the parameter. This two-dimensional viewpoint allows a fine-grained complexity analysis that takes structural properties of problem instances into account.
Samer Marko, Szeider Stefan
openaire +1 more source
Chapter 17. Fixed-Parameter Tractability
2021Parameterized complexity is a new theoretical framework that considers, in addition to the overall input size, the effects on computational complexity of a secondary measurement, the parameter. This two-dimensional viewpoint allows a fine-grained complexity analysis that takes structural properties of problem instances into account.
Samer, Marko, Szeider, Stefan
openaire +1 more source
Fixed-parameter tractability for the Tree Assembly problem
Theoretical Computer Science, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shi, Feng +4 more
openaire +1 more source
Fixed-Parameter Tractability of (n − k) List Coloring
Theory of Computing Systems, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Banik, Aritra +3 more
openaire +1 more source
Fixed-Parameter Tractable Optimization Under DNNF Constraints
2016Minimizing a cost function under a set of combinatorial constraints is a fundamental, yet challenging problem in AI. Fortunately, in various real-world applications, the set of constraints describing the problem structure is much less susceptible to change over time than the cost function capturing user's preferences.
Koriche, Frédéric +3 more
openaire +2 more sources
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Evans, Patricia A. +2 more
openaire +2 more sources
Fixed-Parameter Tractable Reductions to SAT
2014Today’s SAT solvers have an enormous importance and impact in many practical settings. They are used as efficient back-end to solve many NP-complete problems. However, many computational problems are located at the second level of the Polynomial Hierarchy or even higher, and hence polynomial-time transformations to SAT are not possible, unless the ...
Ronald de Haan, Stefan Szeider
openaire +1 more source
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
Artificial Intelligence, 2022Julien Baste +2 more
exaly