arXiv (OAI Expanded)
open access
Certified local rank and uniqueness barriers for a 48-term matrix-multiplication decomposition
We study replacements in fixed bilinear tensor decompositions, counting changes to complete rank-one summands, including output factors. The shortening frontier records the maximum rank defect of a fixed-size subset and determines the minimum length attainable within a change budget. For the rationa
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming#1035072
- A parallel hierarchical blocked adaptive cross approximation algorithm#784358
- TIDE-MC: Two-Sided Interpolative Decomposition for Billion-Scale GPU Matrix Completion#423939
- Tensor decomposition of transportation temporal and spatial big data: A brief review.#4392
- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization#1034009
Record · ID 1071372
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive