activity
19992021
most citedShallow Circuits with High-Powered Inputs

17 citations · 133 across the 31 of their papers we have counts for

collaborators

37 papers

cs.CC2021

Black Box Absolute Reconstruction for Sums of Powers of Linear Forms

Pascal Koiran, Subhayan Saha

We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomized algorithm for the following problem: If a homogeneous polynomial $f \…

gr-qc2021★ 8 cited

Infall time in the Eddington-Finkelstein metric, with application to Einstein-Rosen bridges

Pascal Koiran

The Eddington-Finkelstein metric is obtained from the Schwarzschild metric by a change of the time variable. It is well known that a test mass falling into a black hole does not re…

cs.CC2020

On tensor rank and commuting matrices

Pascal Koiran

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the pr…

cs.CC2019

Derandomization and absolute reconstruction for sums of powers of linear forms

Pascal Koiran, Mateusz Skomra

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogen…

math.RA2019★ 6 cited

Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective

Pascal Koiran

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors…

math.AG2019★ 2 cited

Intersection multiplicity of a sparse curve and a low-degree curve

Pascal Koiran, Mateusz Skomra

Let be a polynomial of degree and let be a polynomial with monomials. We want to estimate the maximal multiplicit…