:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Christandl, Matthias, Gall, François Le, Lysikov, Vladimir, Zuiddam, Jeroen
Format:	Preprint
Published:	2020
Subjects:	Computational Complexity Commutative Algebra 68Q17, 15A69
Online Access:	https://arxiv.org/abs/2003.03019
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Border subrank of higher order tensors and algebras
by: Chang, Chia-Yu, et al.
Published: (2026)

On the computation of tensor functions under tensor-tensor multiplications with linear maps
by: Ju, Jeong-Hoon, et al.
Published: (2025)

Symmetric subrank and its border analogue
by: Biaggi, Benjamin, et al.
Published: (2026)

Concise tensors of minimal border rank
by: Jelisiejew, Joachim, et al.
Published: (2022)

Partial Degeneration of Tensors
by: Christandl, Matthias, et al.
Published: (2022)

Symmetric powers: structure, smoothability, and applications
by: Flavi, Cosimo, et al.
Published: (2024)

Computing moment polytopes -- with a focus on tensors, entanglement and matrix multiplication
by: Berg, Maxim van den, et al.
Published: (2025)

The moment polytope of matrix multiplication is not maximal
by: Berg, Maxim van den, et al.
Published: (2025)

Detecting Direct Sums of Tensors and Their Limits
by: Canino, S., et al.
Published: (2025)

Recent Advances in Debordering Methods
by: Dutta, Pranjal, et al.
Published: (2025)

Exact values of generic subrank
by: Pielasa, Paweł, et al.
Published: (2024)

Border subrank via a generalised Hilbert-Mumford criterion
by: Biaggi, Benjamin, et al.
Published: (2024)

Classification and degenerations of small minimal border rank tensors via modules
by: Jagiełła, Jakub, et al.
Published: (2024)

Discreteness of asymptotic tensor ranks
by: Briët, Jop, et al.
Published: (2023)

Explicit non-free tensors
by: Berg, Maxim van den, et al.
Published: (2025)

Asymptotic tensor rank is characterized by polynomials
by: Christandl, Matthias, et al.
Published: (2024)

Persistent Tensors and Multiqudit Entanglement Transformation
by: Gharahi, Masoud, et al.
Published: (2022)

The next gap in the subrank of 3-tensors
by: Gesmundo, Fulvio, et al.
Published: (2023)

Ideals of Spaces of Degenerate Matrices
by: Vill, Julian, et al.
Published: (2021)

The Separation of $NP$ and $PSPACE$
by: Lin, Tianrong
Published: (2021)

Polynomial Identity Testing via Evaluation of Rational Functions
by: Hu, Ivan, et al.
Published: (2022)

Symmetrization maps and minimal border rank Comon's conjecture
by: Mańdziuk, Tomasz, et al.
Published: (2024)

On Commutative Analogues of Clifford Algebras and Their Decompositions
by: Sharma, Heerak, et al.
Published: (2025)

A weak regularity lemma for polynomials
by: Moshkovitz, Guy, et al.
Published: (2025)

A C implementation of the Smith massager algorithm
by: Wang, Ziwen, et al.
Published: (2026)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
by: Edwards, Darren J.
Published: (2025)

Schur complements for tensors and multilinear commutative rank
by: Moshkovitz, Guy, et al.
Published: (2026)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
by: Lin, Tianrong
Published: (2023)

Beyond the Existential Theory of the Reals
by: Schaefer, Marcus, et al.
Published: (2022)

Completeness classes in algebraic complexity theory
by: Bürgisser, Peter
Published: (2024)

Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness
by: Lysikov, Vladimir, et al.
Published: (2024)

Computing Path Signature Varieties in Macaulay2
by: Améndola, Carlos, et al.
Published: (2025)

Results on three problems on isolation of graphs
by: Borg, Peter, et al.
Published: (2026)

Unifying lower bounds for algebraic machines, semantically
by: Seiller, Thomas, et al.
Published: (2018)

Resolution of The Linear-Bounded Automata Question
by: Lin, Tianrong
Published: (2021)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
by: Lin, Tianrong
Published: (2021)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

The Polynomial Hierarchy does not collapse
by: Czerwinski, Reiner
Published: (2024)

Integer multiplication is at least as hard as matrix transposition
by: Harvey, David, et al.
Published: (2025)

On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups
by: Chen, Zhili, et al.
Published: (2023)