139 citations · 168 across the 14 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019★ 6 cited
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov +2
We study the variety membership testing problem in the case when the variety is given as an orbit closure and the ambient space is the set of all 3-tensors. The first variety that…
cs.CC2019
Parameterized Valiant's Classes
Markus Blaeser, Christian Engels
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolea…