Related papers: On the Complexity of Computing with Planar Algebra…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…
The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…
It is known for a long time that a nonsingular real algebraic curve of degree 2k in the projective plane cannot have more than 7/2*k^2-9/4*k+3/2$ even ovals. We show here that this upper bound is asymptotically sharp, that is to say we…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
We introduce a continuous domain framework for the recovery of a planar curve from a few samples. We model the curve as the zero level set of a trigonometric polynomial. We show that the exponential feature maps of the points on the curve…
In this paper we study planar polynomial differential systems of this form: dX/dt=A(X, Y), dY/dt= B(X, Y), where A,B belongs to Z[X, Y], degA \leq d, degB \leq d, and the height of A and B is smaller than H. A lot of properties of planar…
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and B\"ackstr\"om et al. (2012) picked up this…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
We analyze the bit complexity of an algorithm for the computation of at least one point in each connected component of a smooth real algebraic set. This work is a continuation of our analysis of the hypersurface case (On the bit complexity…
Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l…
We study the topological complexity, in the sense of Smale, of three enumerative problems in algebraic geometry: finding the 27 lines on cubic surfaces, the 28 bitangents and the 24 inflection points on quartic curves. In particular, we…
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…
We prove that there exists a>0 such that for any integer d>2 and any topological types S_1,...,S_n of plane curve singularities, satisfying $\mu(S_1)+...+\mu(S_n) \leq ad^2$, there exists a reduced irreducible plane curve of degree d with…
Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering design problems in which some of the problem parameters are…
We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…
Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…