Results 51 to 60 of about 149,306 (281)
Parameterized complexity of DPLL search procedures [PDF]
, 2011 We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other combinatorial problems.
A. Haken +22 more
core +3 more sources
Parameterized Complexity of Simultaneous Planarity
, 2023 Given $k$ input graphs $G_1, \dots ,G_k$, where each pair $G_i$, $G_j$ with $i \neq j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph such that all drawings coincide on $G$.
Simon D. Fink +2 more
openaire +2 more sources
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 Graph Constraint Logic [PDF]
, 2015 Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions.
van der Zanden, Tom C.
core +2 more sources
Parameterized Complexity of Discrete Morse Theory [PDF]
ACM Transactions on Mathematical Software, 2013 Optimal Morse matchings reveal essential structures of cell complexes that lead to powerful tools to study discrete geometrical objects, in particular, discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds through a reduction to the erasability problem.
Burton, Benjamin A. +3 more
openaire +3 more sources
Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue
Algorithms, 2016 We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj +1 more source
Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In this paper we introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity. The model is a special case of DEL model checking.
Iris van de Pol +2 more
doaj +1 more source
Parameterized complexity of fair deletion problems
, 2017 Deletion problems are those where given a graph $G$ and a graph property $\pi$, the goal is to find a subset of edges such that after its removal the graph $G$ will satisfy the property $\pi$. Typically, we want to minimize the number of elements removed.
Masařík, Tomáš, Toufar, Tomáš
core +1 more source
A LCCR filter based harmonic suppression method for power quality improvement
Energy Reports, 2023 As power converters have been widely used in renewable energy generation and motor drive system for the industrial production, the harmonics of output voltage of power converter will seriously affect the system power quality.
Yunhui Fang +3 more
doaj +1 more source
Parameterized Complexity of Secluded Connectivity Problems [PDF]
, 2015 The Secluded Path problem models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of vertices in ...
Fomin, Fedor V. +3 more
core +4 more sources