22 citations · 39 across the 8 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2018
A nearly optimal algorithm to decompose binary forms
Matías Bender, Jean-Charles Faugère, Ludovic Perret +1
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. I…
cs.SC2013★ 11 cited
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case
Jérémy Berthomieu, Jean-Charles Faugère, Ludovic Perret
Let and be two sets of nonlinear polynomials over ( being a fie…