Related papers: Robust Satisfiability of Systems of Equations

For a function $\mathsf{K} : \mathbb{R}^{d} \times \mathbb{R}^{d} \to \mathbb{R}_{\geq 0}$, and a set $P = \{ x_1, \ldots, x_n\} \subset \mathbb{R}^d$ of $n$ points, the $\mathsf{K}$ graph $G_P$ of $P$ is the complete graph on $n$ nodes…

We consider optimization of nonlinear objective functions that balance $d$ linear criteria over $n$-element independence systems presented by linear-optimization oracles. For $d=1$, we have previously shown that an $r$-best approximate…

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

The first aim of this note is to fill a gap in the literature by proving that, given a global field $K$ and a finite set $\mathcal{S}$ of primes of $K$, every finite split embedding problem $G \rightarrow {\rm{Gal}}(L/K)$ over $K$ with…

While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and H\r{a}stad roved a result known as "$(2+\varepsilon)$-SAT is NP-hard" [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas…

The purpose of this paper is to give a sufficient condition for (strong) stability of non-proper smooth functions (with respect to the Whitney $C^\infty$-topology). We show that a Morse function is stable if it is end-trivial at any point…

We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of $\gamma N$ random boolean constraints which are to be satisfied simultaneously by $N$ logical variables. In…

Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…

This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…

We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where ``many'' stands for an…

Let $\mathbb{K}$ be an uncountable field of characteristic zero and let $f$ be a function from $\mathbb{K}^n$ to $\mathbb{K}$. We show that if the restriction of $f$ to every affine plane $L\subset\mathbb{K}^n$ is regular, then $f$ is a…

Given $K$ arbitrary poles, which are neither necessarily distinct nor bounded, on the extended real line, a corresponding ordered base of rational functions orthogonal with respect to varying exponential weights is constructed: this gives…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

We propose an approach for decomposing Boolean satisfiability problems while extending recent results of \cite{sul2} on solving Boolean systems of equations. Developments in \cite{sul2} were aimed at the expansion of functions $f$ in…

A uniform derivation is presented of the self-consistent field equations in a finite basis set. Both restricted and unrestricted Hartree-Fock (HF) theory as well as various density functional (DF) approximations are considered. The unitary…

Given $k$ sets $\mathcal{A}_i \subseteq \mathbb{F}_q^d$ and a non-degenerate bilinear form $B$ in $\mathbb{F}_q^d$. We consider the system of $l \leq \binom{k}{2}$ bilinear equations \[ B (\tmmathbf{a}_i, \tmmathbf{a}_j) = \lambda_{i j},…

We introduce a notion of \emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators $S$ and relations $R$ is \emph{stable} if any map from $S$ to unitaries that approximately satisfies…

We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet…

In this work we investigate the min-max-min robust optimization problem and the k-adaptability robust optimization problem for binary problems with uncertain costs. The idea of the first approach is to calculate a set of k feasible…

We consider the problem of existence and uniqueness of strong a.e. solutions $u: \mathbb{R}^n \longrightarrow \mathbb{R}^N$ to the fully nonlinear PDE system \[\label{1} \tag{1} F(\cdot,D^2u ) \,=\, f, \ \ \text{ a.e. on }\mathbb{R}^n, \]…