Results 221 to 230 of about 5,303 (261)

Fixed-Parameter Tractability, a Prehistory,

Lecture Notes in Computer Science, 2012
Michael Langston
exaly   +3 more sources

Scheduling and fixed-parameter tractability

Mathematical Programming, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthias Mnich, Andreas Wiese
openaire   +4 more sources

Fixed-parameter tractability for the Tree Assembly problem

Theoretical Computer Science, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng Shi 0003   +4 more
openaire   +1 more source

Fixed-Parameter Tractability

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

Home - About - Disclaimer - Privacy