Related papers: The computational complexity of the Chow form
Germs of plane curve singularities can be classified accordingly to their equisingularity type. For singularities over C, this important data coincides with the topological class. In this paper, we characterise a family of singularities,…
The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible region defined by polynomial (in)equalities. A key feature of…
The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time, scale with the problem size. Many problems in…
We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially…
For real and complex homogeneous cubic polyomials in $n+1$ variables, we prove that the Chow variety of products of linear forms is generically complex identifiable for all ranks up to the generic rank minus two. By integrating fundamental…
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
The Euler characteristic of Chow varieties of algebraic cycles of a given degree in complex projective spaces was computed by Blaine Lawson and Stephen Yau by using holomorphic symmetries of cycles spaces. In this paper we compute this in a…
We show that the equivariant Chow cohomology ring of a toric variety is naturally isomorphic to the ring of integral piecewise polynomial functions on the associated fan. This gives a large class of singular spaces for which localization…
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…
We give a deterministic, polynomial-time algorithm for approximately counting the number of {0,1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter eps, our algorithm…
Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…
The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…
We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…