文章基本信息
- 标题：Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings.
- 本地全文：下载
- 作者：Ankit Garg ; Visu Makam ; Rafael Mendes de Oliveira 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2019
- 卷号：2019
- 页码：1-16
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
We consider the problem of outputting succinct encodings of lists of generators for invariant rings. Mulmuley conjectured that there are always polynomial sized such encodings for all invariant rings. We provide simple examples that disprove this conjecture (under standard complexity assumptions).
- 关键词：algebraic complexity ; geometric complexity theory ; Invariant theory ; lower bounds ; representation theory
