Related papers: VPSPACE and a transfer theorem over the complex fi…

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…

In this paper, we prove a generalization of the Schmidt's subspace theorem for polynomials of higher degree in subgeneral position with respect to a projective variety over a number field. Our result improves and generalizes the previous…

The library \emph{fast\_polynomial} for Sage compiles multivariate polynomials for subsequent fast evaluation. Several evaluation schemes are handled, such as H\"orner, divide and conquer and new ones can be added easily. Notably, a new…

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

In many high-dimensional problems, like sparse-PCA, planted clique, or clustering, the best known algorithms with polynomial time complexity fail to reach the statistical performance provably achievable by algorithms free of computational…

We consider the operation of sum on Kripke frames, where a family of frames-summands is indexed by elements of another frame. In many cases, the modal logic of sums inherits the finite model property and decidability from the modal logic of…

In analogy to valued fields, we study model-theoretic properties of valued vector spaces with variable base field by proving transfer principles down to the skeleton and down to the value set and base field. For instance, we give a formula…

We describe a relationship between the Lie algebra $\mathfrak{sl}_4(\mathbb C)$ and the hypercube graphs. Consider the $\mathbb C$-algebra $P$ of polynomials in four commuting variables. We turn $P$ into an $\mathfrak{sl}_4(\mathbb…

In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…

We study classes $P_{g,T}(\alpha;\beta)$ on the moduli space of stable, genus g curves with rational tails defined by pushing forward the virtual fundamental classes of spaces of relative stable maps to an unparameterized projective line. A…

The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

We consider the problem of determining which classes of functions can be tested more efficiently than they can be learned, in the distribution-free sample-based model that corresponds to the standard PAC learning setting. Our main result…

Although Shapley additive explanations (SHAP) can be computed in polynomial time for simple models like decision trees, they unfortunately become NP-hard to compute for more expressive black-box models like neural networks - where…

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Kerr-Schild formalism is generalized by incorporation of the Kerr Theorem with polynomials of higher degrees in $Y\in CP^1.$ It leads to multisheeted twistor spaces and multiparticle solutions.

We consider a class of non-polynomial spline spaces over T-meshes, that is, of spaces locally spanned both by polynomial and by suitably-chosen non-polynomial functions, which we will refer to as generalized splines over T-meshes. For such…

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

The reviewed paper describes an analog device that empirically solves small instances of the NP-complete Subset Sum Problem (SSP). The authors claim that this device can solve the SSP in polynomial time using polynomial space, in principle,…

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…