Prefer a chat interface with context about you and your work?
Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness
Many natural computational problems in computer science, mathematics, physics, and other sciences amount to deciding if two objects are equivalent. Often this equivalence is defined in terms of group actions. A natural question is to ask when two objects can be distinguished by polynomial functions that are invariant under the …