Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings

Award ID(s):: 1638352

NSF-PAR ID:: 10172712

Author(s) / Creator(s):: Garg, Ankit; Makam, Visu; Oliveira, Rafael; Walter, Michael; Wigderson, Avi

Date Published:: 2020-01-01

Journal Name:: 35th Computational Complexity Conference (CCC 2020)

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.4230/LIPIcs.CCC.2020.12