Related papers: SAT-Based Techniques for Lexicographically Smalles…
Computational micromechanics and homogenization require the solution of the mechanical equilibrium of a periodic cell that comprises a (generally complex) microstructure. Techniques that apply the Fast Fourier Transform have attracted much…
This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…
Many reasoning tasks require short partial satisfying assignments (implicants), sometimes focusing on a set of important variables. SAT-to-Ising-QUBO formulations are implicitly designed so that ground states correspond to total…
Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are…
In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…
Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instance is a combination of traditional clauses and parity…
We classify the representation type of the descent algebras of type $\A$ in the positive characteristic case. The algebras have finite representation type only for a few small degrees; otherwise, they are wild. Our main reduction method…
In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…
This work proposes an adaptive structure-preserving model order reduction method for finite-dimensional parametrized Hamiltonian systems modeling non-dissipative phenomena. To overcome the slowly decaying Kolmogorov width typical of…
We are concerned with the fast simulation of random fields on closed surfaces in $\mathbb{R}^3$ which are generated by the (Whittle-) Mat\'ern class of covariance functions. To this end, we solve the underlying fractional stochastic partial…
Structured canonical forms under unitary and suitable structure-preserving similarity transformations for normal and (skew-)Hamiltonian as well as normal and per(skew)-Hermitian matrices are proposed. Moreover, an algorithm for computing…
The Medial Axis Transform (MAT) is a complete shape descriptor capable of reconstructing the geometry of the original domain. A high-quality MAT should not only facilitate high-fidelity reconstruction but also capture structural features --…
This paper concerns the construction and analysis of a numerical scheme for a mixed discrete-continuous fragmentation equation. A finite volume scheme is developed, based on a conservative formulation of a truncated version of the…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…
Discrete variables are common in many applications, such as probabilistic reasoning, planning and explainable AI. When symbolic reasoning techniques are brought in to bear on these applications, a standard technique for handling discrete…
In this paper, we study the estimation of partially linear models for spatial data distributed over complex domains. We use bivariate splines over triangulations to represent the nonparametric component on an irregular two-dimensional…
We approach the Max-3-Cut problem through the lens of maximizing complex-valued quadratic forms and demonstrate that low-rank structure in the objective matrix can be exploited, leading to alternative algorithms to classical semidefinite…
Answer Set Programming (ASP) is a paradigm for modeling and solving problems for knowledge representation and reasoning. There are plenty of results dedicated to studying the hardness of (fragments of) ASP. So far, these studies resulted in…
Abstractive text summarization aims at compressing the information of a long source document into a rephrased, condensed summary. Despite advances in modeling techniques, abstractive summarization models still suffer from several key…