相关论文: The intrinsic complexity of parametric elimination…
Driven by the challenging task of finding robust discretization methods for Galbrun's equation, we investigate conditions for stability and different aspects of robustness for different finite element schemes on a simplified version of the…
Flexible systems are linear systems of inclusions in which the elements of the coefficient matrix are external numbers in the sense of nonstandard analysis. External numbers represent real numbers with small, individual error terms. Using…
Runtime efficiency and termination are crucial properties in the studies of program verification. Instead of dealing with these issues in an ad hoc manner, it would be useful to develop a robust framework in which such properties are…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
To explain predictions made by complex machine learning models, many feature attribution methods have been developed that assign importance scores to input features. Some recent work challenges the robustness of these methods by showing…
The problem of optimizing over random structures emerges in many areas of science and engineering, ranging from statistical physics to machine learning and artificial intelligence. For many such structures finding optimal solutions by means…
We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity. This…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues…
An analogue of geometric quantization of Poisson algebras obtained by algebraic reduction of symmetries is developed. Interpretation of the obtained results and their application to the problem of commutativity of quantization and reduction…
The algebro-geometric approach for integrability of semi-Hamiltonian hydrodynamic type systems is presented. This method is significantly simplified for so-called symmetric hydrodynamic type systems. Plenty interesting and physically…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
Mueller polarimetry involves a variety of instruments and technologies whose importance and scope of applications are rapidly increasing. The exploitation of these powerful resources depends strongly on the mathematical models that underlie…
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of…
An algebraic characterization of the property of approximate controllability is given, for behaviours of spatially invariant dynamical systems, consisting of distributional solutions, that are periodic in the spatial variables, to a system…
We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.
The classical approach to solvability of a mathematical problem is to define a method which includes certain rules of operation or algorithms. Then using the defined method, one can show that some problems are solvable or not solvable or…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
We propose and investigate probabilistic guarantees for the adversarial robustness of classification algorithms. While traditional formal verification approaches for robustness are intractable and sampling-based approaches do not provide…
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise…