scientific article; zbMATH DE number 7711614

DOI10.4230/lipics.ccc.2021.32arXiv2102.07727MaRDI QIDQ6115395

Avi Wigderson, Michael Walter, Peter Bürgisser, Visu Makam, M. Levent Doğan

Publication date: 12 July 2023

Full work available at URL: https://arxiv.org/abs/2102.07727

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

geometric complexity theorycomputational invariant theoryorbit closure intersection problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Separating monomials for diagonalizable actions ⋮ Polystability in positive characteristic and degree lower bounds for invariant rings

This page was built for publication: