Results 71 to 80 of about 2,051,541 (361)
On the Average-case Complexity of Parameterized Clique [PDF]
, 2014 The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W[1]-complete problems.
Bollobás +22 more
core +2 more sources
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping [PDF]
Algorithmica, 2020 In the Token Jumping problem we are given a graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
Valentin Bartier +4 more
semanticscholar +1 more source
Parameterized complexity of MaxSat Above Average [PDF]
Theoretical Computer Science, 2012 In MaxSat, we are given a CNF formula $F$ with $n$ variables and $m$ clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let $r_1,..., r_m$ be the number of literals in the clauses of $F$. Then $asat(F)=\sum_{i=1}^m (1-2^{-r_i})$ is the expected number of clauses satisfied by a random truth assignment (the truth ...
Crowston, Robert +4 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
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 bounded-depth Frege is not optimal [PDF]
, 2011 A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate on tree-like Parameterized Resolution-a parameterized version of classical Resolution-and their gap complexity ...
A. Haken +17 more
core +8 more sources
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
Algorithms, 2013 We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +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 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