Results 21 to 30 of about 19,138 (262)

Parameterized parallel complexity [PDF]

, 1998
We introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of NC.
Cesati M., Di Ianni M.
openaire   +3 more sources

Counting Problems in Parameterized Complexity

Tsinghua Science and Technology, 2014
Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many 𝐍𝐏-hard problems and also provides a much finer complexity classification for other intractable problems ...
Chihao Zhang, Yijia Chen
doaj   +1 more source

Parameterized complexity of firefighting

Journal of Computer and System Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen   +5 more
openaire   +4 more sources

On the Parameterized Complexity of Consensus Clustering [PDF]

Theoretical Computer Science, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller   +3 more
openaire   +2 more sources

On the parameterized complexity of computing tree-partitions [PDF]

Discrete Mathematics & Theoretical Computer Science
We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender, Carla Groenland, Hugo Jacob   +2 more
doaj   +1 more source

A Brief Survey of Fixed-Parameter Parallelism

Algorithms, 2020
This paper provides an overview of the field of parameterized parallel complexity by surveying previous work in addition to presenting a few new observations and exploring potential new directions.
Faisal N. Abu-Khzam, Karam Al Kontar
doaj   +1 more source

Computation Models for Parameterized Complexity [PDF]

Mathematical Logic Quarterly, 1997
AbstractA parameterized computational problem is a set of pairs (x,k), wherekis a distinguished item called “parameter”. FPT is the class of fixed‐parameter tractable problems: for any fixed value ofk, they are solvable in time bounded by a polynomial of degree α, where α is a constant not dependent on the parameter. In order to deal with parameterized
Cesati M., Di Ianni M.
openaire   +2 more sources

Parameterized Complexity of Geodetic Set

Journal of Graph Algorithms and Applications, 2022
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb{N}$, the NP-hard ${\rm G{\small EODETIC}~S{ \small ET}}$ problem asks whether there is a geodetic set of size at most $k$.
Leon Kellerhals, Tomohiro Koana
openaire   +4 more sources

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

Algorithms, 2019
We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not.
Ronald de Haan, Stefan Szeider
doaj   +1 more source

Taming the Chaos in Neural Network Time Series Predictions

Entropy, 2021
Machine learning methods, such as Long Short-Term Memory (LSTM) neural networks can predict real-life time series data. Here, we present a new approach to predict time series data combining interpolation techniques, randomly parameterized LSTM neural ...
Sebastian Raubitzek, Thomas Neubauer
doaj   +1 more source