Results 21 to 30 of about 147,152 (326)
Parameterized complexity of reconfiguration of atoms
Algorithmica, 2022 Abstract Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate the atoms so that they form a dense and regular arrangement, such as all locations in a grid ...
Cooper, Alexandre +3 more
openaire +2 more sources
Parameterized Complexity of Broadcasting in Graphs
Theoretical Computer Science, 2023 The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, at each round, an informed vertex can transmit the information to at most one of its neighbors.
Fomin, Fedor +2 more
openaire +5 more sources
Parameterized Complexity of Eulerian Deletion Problems. [PDF]
Algorithmica, 2014 We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc.
Cygan M +4 more
europepmc +10 more sources
Parameterized complexity of quantum invariants [PDF]
, 2019 We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a $O(N^{\frac{3}{2} \mathrm{cw}} \mathrm{poly}(n))$ time algorithm to compute any Reshetikhin-Turaev invariant---derived
Clément Maria
openalex +6 more sources
On the parameterized complexity of (k,s)-SAT [PDF]
Information Processing Letters, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paulusma, D., Szeider, S.
openaire +2 more sources
Improving Vertex Cover as a Graph Parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
doaj +1 more source
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Algorithms, 2020 Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann +3 more
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
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
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