Imagen de Portada

On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Grochow, Joshua A., Qiao, Youming
Formato:	Preprint
Publicado:	2023
Materias:	Computational Complexity Data Structures and Algorithms Algebraic Geometry Group Theory 68Q25, 15A69, 15A72, 15A21, 15A63, 68Q15, 16Z05, 17B99, 17A40, 20D15, 20-08 F.1.3; F.2.2; I.1.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
por: Grochow, Joshua A., et al.
Publicado: (2019)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
por: Grochow, Joshua A., et al.
Publicado: (2021)

Border rank bounds for $GL(V)$-invariant tensors arising from matrices of constant rank
por: Wu, Derek
Publicado: (2024)

Completeness classes in algebraic complexity theory
por: Bürgisser, Peter
Publicado: (2024)

HOSCF: Efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors
por: Xiao, Chuanfu, et al.
Publicado: (2024)

Separation and Collapse of Equilibria Inequalities on AND-OR Trees without Shape Constraints
por: Ito, Fuki, et al.
Publicado: (2024)

Randomized algorithms for computing the tensor train approximation and their applications
por: Che, Maolin, et al.
Publicado: (2024)

Almost all subgeneric third-order Chow decompositions are identifiable
por: Torrance, Douglas A., et al.
Publicado: (2021)

Barriers for rectangular matrix multiplication
por: Christandl, Matthias, et al.
Publicado: (2020)

Count-Free Weisfeiler--Leman and Group Isomorphism
por: Collins, Nathaniel A., et al.
Publicado: (2022)

Permanental rank versus determinantal rank of random matrices over finite fields
por: Ghasemi, Fatemeh, et al.
Publicado: (2025)

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

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
por: Lela, Marko
Publicado: (2025)

Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
por: Che, Maolin, et al.
Publicado: (2025)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
por: Grochow, Joshua A., et al.
Publicado: (2025)

Effective algorithms for tensor train decomposition via the UTV framework
por: Wang, Yuchao, et al.
Publicado: (2025)

HaTT: Hadamard avoiding TT recompression
por: Sun, Zhonghao, et al.
Publicado: (2024)

Where Have All the Kaczmarz Iterates Gone?
por: Bergou, El Houcine, et al.
Publicado: (2025)

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
por: Bergou, El Houcine, et al.
Publicado: (2023)

Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
por: He, Haoze, et al.
Publicado: (2024)

Generalisations of Matrix Partitions : Complexity and Obstructions
por: Barsukov, Alexey, et al.
Publicado: (2021)

How Does Machine Learning Manage Complexity?
por: Fortnow, Lance
Publicado: (2026)

Computational Complexity of Physical Counting
por: Simas, Tristan
Publicado: (2026)

Which variables of a numerical problem cause ill-conditioning?
por: Dewaele, Nick
Publicado: (2025)

Which constraints of a numerical problem cause ill-conditioning?
por: Dewaele, Nick, et al.
Publicado: (2023)

Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective
por: Al-atar, Munqath, et al.
Publicado: (2024)

Approximate Integrity Constraints in Incomplete Databases With Limited Domains
por: Al-atar, Munqath, et al.
Publicado: (2024)

Shifted Partial Derivative Polynomial Rank and Codimension
por: Edwards, Darren J.
Publicado: (2025)

Sharp error bounds for approximate eigenvalues and singular values from subspace methods
por: Haas, Irina-Beatrice, et al.
Publicado: (2025)

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
por: Dong, Yijun, et al.
Publicado: (2022)

Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
por: Lazzarino, Lorenzo, et al.
Publicado: (2024)

Structured Multidimensional Representation Learning for Large Language Models
por: Ichi, Alaa El, et al.
Publicado: (2026)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
por: Bodirsky, Manuel, et al.
Publicado: (2023)

The Quasi-probability Method and Applications for Trace Reconstruction
por: Rubinstein, Ittai
Publicado: (2024)

Towards an Efficient Shifted Cholesky QR for Applications in Model Order Reduction using pyMOR
por: Bindhak, Maximilian, et al.
Publicado: (2025)

A Family of Iterative Methods for Computing Generalized Inverses of Quaternion Matrices and its Applications
por: Karmakar, Biswarup, et al.
Publicado: (2026)

Mastering NIM and Impartial Games with Weak Neural Networks: An AlphaZero-inspired Multi-Frame Approach
por: Riis, Søren
Publicado: (2024)

Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow
por: Riis, Søren
Publicado: (2026)

The Polynomial Hierarchy does not collapse
por: Czerwinski, Reiner
Publicado: (2024)