相关论文: SPM Bulletin 12

This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family…

In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…

This paper addresses a class of elliptic problems involving the superposition of nonlinear fractional operators with the critical Sobolev exponent in the sublinear regimes. We establish the existence of infinitely many nontrivial weak…

We study the problem of approximating and learning coverage functions. A function $c: 2^{[n]} \rightarrow \mathbf{R}^{+}$ is a coverage function, if there exists a universe $U$ with non-negative weights $w(u)$ for each $u \in U$ and subsets…

Thanks to its great potential in reducing both computational cost and memory requirements, combining sketching and Krylov subspace techniques has attracted a lot of attention in the recent literature on projection methods for linear…

This paper introduces the 2019 version of \us{}, a novel Constraint Programming framework for floating point verification problems expressed with the SMT language of SMTLIB. SMT solvers decompose their task by delegating to specific…

We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…

We establish some higher differentiability results of integer and fractional order for solution to non-autonomous obstacle problems of the form \begin{equation*} \min \left\{\int_{\Omega}f(x, Dv(x))\,:\, v\in…

Contextual Markov decision processes (CMDPs) describe a class of reinforcement learning problems in which the transition kernels and reward functions can change over time with different MDPs indexed by a context variable. While CMDPs serve…

We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…

This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…

We discuss one natural class of kernels on pseudo-Riemannian symmetric spaces.

The class P is in fact a proper sub-class of NP. We explore topological properties of the Hamming space 2^[n] where [n]={1, 2,..., n}. With the developed theory, we show: (i) a theorem that is closely related to Erdos and Rado's sunflower…

Markov decision processes (MDPs) are a canonical model to reason about decision making within a stochastic environment. We study a fundamental class of infinite MDPs: one-counter MDPs (OC-MDPs). They extend finite MDPs via an associated…

This lectures notes consists of four lectures. The first lecture discusses questions around Hilbert-Arnold Problem which is naturally arises from Quantitative Hilbert 16-th problem. In the second lecture we outline author's solution of a…

Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$…

It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta<\kappa$, the existence of a strongly unbounded coloring…

The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…