Saved in:
| Main Authors: | Grochow, Joshua A., Qiao, Youming |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2306.16317 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
by: Grochow, Joshua A., et al.
Published: (2019)
by: Grochow, Joshua A., et al.
Published: (2019)
On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups
by: Chen, Zhili, et al.
Published: (2023)
by: Chen, Zhili, et al.
Published: (2023)
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
by: Grochow, Joshua A., et al.
Published: (2021)
by: Grochow, Joshua A., et al.
Published: (2021)
Border rank bounds for $GL(V)$-invariant tensors arising from matrices of constant rank
by: Wu, Derek
Published: (2024)
by: Wu, Derek
Published: (2024)
Completeness classes in algebraic complexity theory
by: Bürgisser, Peter
Published: (2024)
by: Bürgisser, Peter
Published: (2024)
Separation and Collapse of Equilibria Inequalities on AND-OR Trees without Shape Constraints
by: Ito, Fuki, et al.
Published: (2024)
by: Ito, Fuki, et al.
Published: (2024)
Count-Free Weisfeiler--Leman and Group Isomorphism
by: Collins, Nathaniel A., et al.
Published: (2022)
by: Collins, Nathaniel A., et al.
Published: (2022)
HOSCF: Efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors
by: Xiao, Chuanfu, et al.
Published: (2024)
by: Xiao, Chuanfu, et al.
Published: (2024)
Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness
by: Lysikov, Vladimir, et al.
Published: (2024)
by: Lysikov, Vladimir, et al.
Published: (2024)
Almost all subgeneric third-order Chow decompositions are identifiable
by: Torrance, Douglas A., et al.
Published: (2021)
by: Torrance, Douglas A., et al.
Published: (2021)
On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
by: Grochow, Joshua A., et al.
Published: (2025)
by: Grochow, Joshua A., et al.
Published: (2025)
Permanental rank versus determinantal rank of random matrices over finite fields
by: Ghasemi, Fatemeh, et al.
Published: (2025)
by: Ghasemi, Fatemeh, et al.
Published: (2025)
Computational Complexity of Physical Counting
by: Simas, Tristan
Published: (2026)
by: Simas, Tristan
Published: (2026)
IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
by: Lela, Marko
Published: (2025)
by: Lela, Marko
Published: (2025)
Barriers for rectangular matrix multiplication
by: Christandl, Matthias, et al.
Published: (2020)
by: Christandl, Matthias, et al.
Published: (2020)
Randomized algorithms for computing the tensor train approximation and their applications
by: Che, Maolin, et al.
Published: (2024)
by: Che, Maolin, et al.
Published: (2024)
How Does Machine Learning Manage Complexity?
by: Fortnow, Lance
Published: (2026)
by: Fortnow, Lance
Published: (2026)
Where Have All the Kaczmarz Iterates Gone?
by: Bergou, El Houcine, et al.
Published: (2025)
by: Bergou, El Houcine, et al.
Published: (2025)
A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
by: Bergou, El Houcine, et al.
Published: (2023)
by: Bergou, El Houcine, et al.
Published: (2023)
Generalisations of Matrix Partitions : Complexity and Obstructions
by: Barsukov, Alexey, et al.
Published: (2021)
by: Barsukov, Alexey, et al.
Published: (2021)
HaTT: Hadamard avoiding TT recompression
by: Sun, Zhonghao, et al.
Published: (2024)
by: Sun, Zhonghao, et al.
Published: (2024)
Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
by: Che, Maolin, et al.
Published: (2025)
by: Che, Maolin, et al.
Published: (2025)
Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
by: He, Haoze, et al.
Published: (2024)
by: He, Haoze, et al.
Published: (2024)
Conserved active information
by: Chen, Yanchen, et al.
Published: (2025)
by: Chen, Yanchen, et al.
Published: (2025)
Which variables of a numerical problem cause ill-conditioning?
by: Dewaele, Nick
Published: (2025)
by: Dewaele, Nick
Published: (2025)
Which constraints of a numerical problem cause ill-conditioning?
by: Dewaele, Nick, et al.
Published: (2023)
by: Dewaele, Nick, et al.
Published: (2023)
Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)
by: Anand, Bhupinder Singh
Published: (2024)
The Polynomial Hierarchy does not collapse
by: Czerwinski, Reiner
Published: (2024)
by: Czerwinski, Reiner
Published: (2024)
The Complexity of Resilience Problems via Valued Constraint Satisfaction
by: Bodirsky, Manuel, et al.
Published: (2023)
by: Bodirsky, Manuel, et al.
Published: (2023)
The Quasi-probability Method and Applications for Trace Reconstruction
by: Rubinstein, Ittai
Published: (2024)
by: Rubinstein, Ittai
Published: (2024)
Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow
by: Riis, Søren
Published: (2026)
by: Riis, Søren
Published: (2026)
Shifted Partial Derivative Polynomial Rank and Codimension
by: Edwards, Darren J.
Published: (2025)
by: Edwards, Darren J.
Published: (2025)
Effective algorithms for tensor train decomposition via the UTV framework
by: Wang, Yuchao, et al.
Published: (2025)
by: Wang, Yuchao, et al.
Published: (2025)
Towards an Efficient Shifted Cholesky QR for Applications in Model Order Reduction using pyMOR
by: Bindhak, Maximilian, et al.
Published: (2025)
by: Bindhak, Maximilian, et al.
Published: (2025)
Mastering NIM and Impartial Games with Weak Neural Networks: An AlphaZero-inspired Multi-Frame Approach
by: Riis, Søren
Published: (2024)
by: Riis, Søren
Published: (2024)
Structured Multidimensional Representation Learning for Large Language Models
by: Ichi, Alaa El, et al.
Published: (2026)
by: Ichi, Alaa El, et al.
Published: (2026)
Exact values of generic subrank
by: Pielasa, Paweł, et al.
Published: (2024)
by: Pielasa, Paweł, et al.
Published: (2024)
Border subrank via a generalised Hilbert-Mumford criterion
by: Biaggi, Benjamin, et al.
Published: (2024)
by: Biaggi, Benjamin, et al.
Published: (2024)
Neural Learning of Fast Matrix Multiplication Algorithms: A StrassenNet Approach
by: Andreini, Paolo, et al.
Published: (2026)
by: Andreini, Paolo, 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)
by: Ju, Jeong-Hoon, et al.
Published: (2025)
Similar Items
-
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
by: Grochow, Joshua A., et al.
Published: (2019) -
On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups
by: Chen, Zhili, et al.
Published: (2023) -
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
by: Grochow, Joshua A., et al.
Published: (2021) -
Border rank bounds for $GL(V)$-invariant tensors arising from matrices of constant rank
by: Wu, Derek
Published: (2024) -
Completeness classes in algebraic complexity theory
by: Bürgisser, Peter
Published: (2024)