Related papers: Why is it hard to beat $O(n^2)$ for Longest Common…
We show that there is no $2^{o(k^2)} n^{O(1)}$ time algorithm for Independent Set on $n$-vertex graphs with rank-width $k$, unless the Exponential Time Hypothesis (ETH) fails. Our lower bound matches the $2^{O(k^2)} n^{O(1)}$ time algorithm…
In this paper we study weakly hyperbolic second order equations with time dependent irregular coefficients. This means to assume that the coefficients are less regular than H\"older. The characteristic roots are also allowed to have…
Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let $n$ denote the size of the array. Simple $O(n\log n)$ algorithms are known for this problem. We develop a polylogarithmic time randomized…
In this paper, the solvability of discrete-time stochastic linear-quadratic (LQ) optimal control problem in finite horizon is considered. Firstly, it shows that the closed-loop solvability for the LQ control problem is optimal if and only…
The problem of finding longest common subsequence (LCS) is one of the fundamental problems in computer science, which finds application in fields such as computational biology, text processing, information retrieval, data compression etc.…
A classical measure of string comparison is given by the longest common subsequence (LCS) problem on a pair of strings. We consider its generalisation, called the semi-local LCS problem, which arises naturally in many string-related…
We consider the problem of strong (amplitude-wise) simulation of $n$-qubit quantum circuits, and identify a subclass of simulators we call monotone. This subclass encompasses almost all prominent simulation techniques. We prove an…
In this paper, we study the regularity of weak solutions and subsolutions of second-order elliptic equations having a gradient term with superquadratic growth. We show that, under appropriate integrability conditions on the data, all weak…
We consider a classical scheduling problem on $m$ identical machines. For an arbitrary constant $q>1$, the aim is to assign jobs to machines such that $\sum_{i=1}^m C_i^q$ is minimized, where $C_i$ is the total processing time of jobs…
In this paper, the open-loop, closed-loop, and weak closed-loop solvability for discrete-time linear-quadratic (LQ) control problem is considered due to the fact that it is always open-loop optimal solvable if the LQ control problem is…
At CPM 2017, Castelli et al. define and study a new variant of the Longest Common Subsequence Problem, termed the Longest Filled Common Subsequence Problem (LFCS). For the LFCS problem, the input consists of two strings $A$ and $B$ and a…
A powerful technique for solving combinatorial optimization problems is to reduce the search space without compromising the solution quality by exploring intrinsic mathematical properties of the problems. For the maximum weight independent…
In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input…
This paper investigates a linear quadratic stochastic optimal control (LQSOC) problem with partial information. Firstly, by introducing two Riccati equations and a backward stochastic differential equation (BSDE), we solve this LQSOC…
We investigate fine-grained algorithmic aspects of identification problems in graphs and set systems, with a focus on Locating-Dominating Set and Test Cover. We prove the (tight) conditional lower bounds for these problems when…
Using a recent result of C. De Lellis and L. Sz\'{e}kelyhidi Jr. we show that, in the case of periodic boundary conditions and for dimension greater or equal 2, there exist infinitely many global weak solutions to the incompressible Euler…
At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a number of problems related to the classic Feedback Vertex Set (FVS) problem do not admit a $2^{o(k \log k)} \cdot n^{\mathcal{O}(1)}$-time algorithm on graphs of treewidth…
In this paper we study higher order weakly hyperbolic equations with time dependent non-regular coefficients. The non-regularity here means less than H\"older, namely bounded coefficients. As for second order equations in \cite{GR:14} we…
Given a sequence of n numbers, the Maximum Consecutive Subsums Problem (MCSP) asks for the maximum consecutive sum of lengths l for each l = 1,...,n. No algorithm is known for this problem which is significantly better than the naive…
Suppose we want to seek the longest common subsequences (LCSs) of two strings as informative patterns that explain the relationship between the strings. The dynamic programming algorithm gives us a table from which all LCSs can be extracted…