107 citations · 618 across the 21 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
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.CC2013★ 84 cited
Complexity Hierarchies Beyond Elementary
Sylvain Schmitz
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classifi…