Related papers: Uniqueness in quadratic and hyperbolic 0-1 program…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
We close three open problems in the separation complexity of valid inequalities for the knapsack polytope. Specifically, we establish that the separation problems for extended cover inequalities, (1,k)-configuration inequalities, and weight…
We are studying $d$-dimensional geometric problems that have algorithms with $1-1/d$ appearing in the exponent of the running time, for example, in the form of $2^{n^{1-1/d}}$ or $n^{k^{1-1/d}}$. This means that these algorithms perform…
The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem. Despite multiple insightful results in the past few years, a proof for…
${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…
We consider the hyperbolic-parabolic singular perturbation problem for a nondegenerate quasilinear equation of Kirchhoff type with weak dissipation. This means that the dissipative term is multiplied by a coefficient b(t) which tends to 0…
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
In this paper we study quantum algorithms for NP-complete problems whose best classical algorithm is an exponential time application of dynamic programming. We introduce the path in the hypercube problem that models many of these dynamic…
An abstract nonautonomous parabolic linear-quadratic regulator problem with very general final cost operator P_T is considered, subject to the same assumptions under which a classical solution of the associated differential Riccati equation…
We prove the global classical solvability of initial-boundary problems for semilinear first-order hyperbolic systems subjected to local and nonlocal nonlinear boundary conditions. We also establish lower bounds for the order of nonlinearity…
We prove some sharp regularity results for solutions of classical first order hyperbolic initial boundary value problems. Our two main improvements on the existing litterature are weaker regularity assumptions for the boundary data and…
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…
This paper studies the Cauchy problem for variable coefficient weakly hyperbolic first order systems of partial differential operators. The hyperbolicity assumption is that for each $t, x$ the principal symbol is hyperbolic. No hypothesis…
In the first part of this work [32], we introduce a convex parabolic relaxation for quadratically-constrained quadratic programs, along with a sequential penalized parabolic relaxation algorithm to recover near-optimal feasible solutions.…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
We Classify the rational quadratic extensions K and the finite groups G for which the group ring R[G] of G over the ring R of integers of K has the property that the group of units of augmentation 1 of R[G] is hyperbolic. We also construct…
The article is devoted to the existence of solutions of a certain system of quadratic integral equations in H^1(R, R^N). We show the existence of a perturbed solution by using a fixed point technique in the Sobolev space on the real line.
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…
We consider the parity variants of basic problems studied in fine-grained complexity. We show that finding the exact solution is just as hard as finding its parity (i.e. if the solution is even or odd) for a large number of classical…
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull…