1 citations · 1 across the 4 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
On the Complexity of the Skolem Problem at Low Orders
Piotr Bacik, Joël Ouaknine, James Worrell
The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) over the integers has a zero term, that is, whether there e…
cs.CC2025
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
Klara Nosan, Amaury Pouly, Sylvain Schmitz +2
We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jean…
cs.CC2024
Identity Testing for Radical Expressions
Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi +1
We study the Radical Identity Testing problem (RIT): Given an algebraic circuit representing a polynomial and nonnegative integers $a_1, \ldots,…