GEOMETRIC COMPLEXITY THEORY V: EFFICIENT ALGORITHMS FOR NOETHER NORMALIZATION
成果类型:
Article
署名作者:
Mulmuley, Ketan D.
署名单位:
University of Chicago
刊物名称:
JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY
ISSN/ISSBN:
0894-0347
DOI:
10.1090/jams/864
发表日期:
2017
页码:
225-309
关键词:
p vs. np
Lower bounds
probabilistic algorithms
semi-invariants
POLYNOMIALS
REPRESENTATIONS
QUIVERS
rings
来源URL: