Results 71 to 80 of about 23,779 (205)
Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
Algorithms, 2016 Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them.
Henrik Björklund +2 more
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
A Parameterized Complexity View on Collapsing k-Cores [PDF]
, 2019 We study the NP-hard graph problem Collapsed k-Core where, given an undirected graph G and integers b, x, and k, we are asked to remove b vertices such that the k-core of remaining graph, that is, the (uniquely determined) largest induced subgraph with ...
Suchý, Ondrej +2 more
core +1 more source
The Parameterized Complexity of Graph Cyclability [PDF]
SIAM Journal on Discrete Mathematics, 2014 The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least $k,$ is {\sf NP}-hard. We study the parametrized complexity of this problem.
Golovach, Petr A. +3 more
openaire +6 more sources
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
On the Parameterized Complexity of Pooling Design [PDF]
Journal of Computational Biology, 2009 Pooling design is a very helpful tool for reducing the number of tests in DNA library screening, which is a key process to obtain high-quality DNA libraries for studying gene functions. Three basic problems in pooling design are, given an m x n binary matrix and a positive integer d, to decide whether the matrix is d-separable (d-separable, or d ...
Yongxi Cheng +3 more
openaire +2 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
The Parameterized Complexity of Dependency Detection in Relational Databases [PDF]
, 2017 We study the parameterized complexity of classical problems that arise in the profiling of relational data. Namely, we characterize the complexity of detecting unique column combinations (candidate keys), functional dependencies, and inclusion ...
Schirneck, Martin +2 more
core +1 more source
Towards exact structural thresholds for parameterized complexity
, 2022 Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them are optimal ...
Hegerfeld, Falko, Kratsch, Stefan
core +1 more source
IEEE Access, 2022 The relaxation method of Tuan et al. (2001, Theorem 2.2) has been used in various studies to deal with parameterized linear matrix inequalities (PLMIs) without excessively increasing computational complexity.
Sung Hyun Kim
doaj +1 more source