14 citations · 25 across the 9 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings
Ankit Garg, Christian Ikenmeyer, Visu Makam +3
We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized su…
cs.CC2019
More barriers for rank methods, via a "numeric to symbolic" transfer
Ankit Garg, Visu Makam, Rafael Oliveira +1
We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal ran…