Related papers: Robust Satisfiability of Systems of Equations

We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity --- a transducer is K-(Lipschitz) robust if the…

For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{Hom($H$)} we denote the computational problem which asks…

A function $f\colon\mathbb R\to\mathbb R$ is called \emph{$k$-monotone} if it is $(k-2)$-times differentiable and its $(k-2)$nd derivative is convex. A point set $P\subset\mathbb R^2$ is \emph{$k$-monotone interpolable} if it lies on a…

The continuous evolution of a wide variety of systems, including continuous-time Markov chains and linear hybrid automata, can be described in terms of linear differential equations. In this paper we study the decision problem of whether…

In this paper we study the regularity of stationary and minimizing harmonic maps $f:B_2(p)\subseteq M\to N$ between Riemannian manifolds. If $S^k(f)\equiv\{x\in M: \text{ no tangent map at $x$ is }k+1\text{-symmetric}\}$ is $k^{th}$-stratum…

Rate-independent systems arise in a number of applications. Usually, weak solutions to such problems with potentially very low regularity are considered, requiring mathematical techniques capable of handling nonsmooth functions. In this…

Let $2\le n\le9$. Suppose that $f:R\to R$ is locally Lipschitz function satisfying $f(t)\ge A\min\{0,t\}-K$ for all $t\in R$ with some constant $A\ge0$ and $K\ge 0$. We establish an a priori interior H\"older regularity of $C^2$-stable…

Knuth (1990) introduced the class of nested formulas and showed that their satisfiability can be decided in polynomial time. We show that, parameterized by the size of a smallest strong backdoor set to the target class of nested formulas,…

We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

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 show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…

ML models are typically trained using large datasets of high quality. However, training datasets often contain inconsistent or incomplete data. To tackle this issue, one solution is to develop algorithms that can check whether a prediction…

We consider the problem of measuring the margin of robust feasibility of solutions to a system of nonlinear equations. We study the special case of a system of quadratic equations, which shows up in many practical applications such as the…

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

Let $P:\{0,1\}^k \to \{0,1\}$ be a nontrivial $k$-ary predicate. Consider a random instance of the constraint satisfaction problem $\mathrm{CSP}(P)$ on $n$ variables with $\Delta n$ constraints, each being $P$ applied to $k$ randomly chosen…

We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…

We consider sets $\Gamma(n,s,k)$ of narrow clauses expressing that no definition of a size $s$ circuit with $n$ inputs is refutable in resolution R in $k$ steps. We show that every CNF shortly refutable in Extended R, ER, can be easily…

Robust stability problem of integral delay systems with uncertain kernel matrix functions is addressed in this paper. On the basis of characteristic equation and the argument principle, an algorithm is generated which is shown to outperform…

A finite constraint language $\mathscr{R}$ is a finite set of relations over some finite domain $A$. We show that intractability of the constraint satisfaction problem $\operatorname{CSP}(\mathscr{R})$ can, in all known cases, be replaced…