Image de couverture de livre

A universal sequence of tensors for the asymptotic rank conjecture

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kaski, Petteri, Michałek, Mateusz
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity Data Structures and Algorithms Algebraic Geometry 14N07, 68W30 I.1.2; F.2.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Binary Decision Diagram Manipulation in External Memory
par: Sølvsten, Steffan Christ, et autres
Publié: (2021)

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
par: Sølvsten, Steffan Christ, et autres
Publié: (2024)

Iterated Resultants and Rational Functions in Real Quantifier Elimination
par: Davenport, James H., et autres
Publié: (2023)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Symbolic Model Checking in External Memory
par: Sølvsten, Steffan Christ, et autres
Publié: (2025)

Computing bases in Hermite normal form of lattices of integer relations
par: Labahn, George, et autres
Publié: (2026)

Equi-affine minimal-degree moving frames for polynomial curves
par: Hong, Hoon, et autres
Publié: (2024)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
par: Sølvsten, Steffan Christ, et autres
Publié: (2023)

NP-membership for the boundary-boundary art-gallery problem
par: Stade, Jack
Publié: (2025)

Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
par: England, Matthew
Publié: (2024)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
par: Li, Yifei
Publié: (2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
par: Gratton, Serge, et autres
Publié: (2024)

Enhanced CAD-Based Quantifier Elimination With Multiple Equational Constraints
par: Davenport, James H., et autres
Publié: (2026)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
par: Cicirello, Vincent A.
Publié: (2024)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
par: Rahat, Md Tanzeem, et autres
Publié: (2025)

Algorithms for Generating Small Random Samples
par: Cicirello, Vincent A.
Publié: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

Symbolic Summation of Multivariate Rational Functions
par: Chen, Shaoshi, et autres
Publié: (2022)

Computing the Skyscraper Invariant
par: Fersztand, Marc, et autres
Publié: (2026)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
par: Toint, Philippe L.
Publié: (2024)

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
par: Koiran, Pascal, et autres
Publié: (2024)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
par: Koiran, Pascal, et autres
Publié: (2022)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
par: Kumar, Mrinal, et autres
Publié: (2018)

A High-Performance External Validity Index for Clustering with a Large Number of Clusters
par: Karbasian, Mohammad Yasin, et autres
Publié: (2024)

Large Language Models in Software Documentation and Modeling: A Literature Review and Findings
par: Radosky, Lukas, et autres
Publié: (2026)

A Galois-Theoretic Complexity Measure for Solving Systems of Algebraic Equations
par: Duff, Timothy
Publié: (2025)

Nonlinear methods for tensors: determinantal equations for secant varieties beyond cactus
par: Doležálek, Matěj, et autres
Publié: (2026)

STRIDE: A Self-Reflective Agent Framework for Reliable Automatic Equation Discovery
par: Su, Jiarui, et autres
Publié: (2026)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
par: Zhong, Xianghui
Publié: (2018)

$XX^{t}$ Can Be Faster
par: Rybin, Dmitry, et autres
Publié: (2025)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
par: Li, Shisheng
Publié: (2026)

Deciding summability via residues in theory and in practice
par: Arreche, Carlos E.
Publié: (2025)

A certified classification of first-order controlled coaxial telescopes
par: Drogoul, Audric
Publié: (2024)

Parallel Self-Avoiding Walks for a Low-Autocorrelation Binary Sequences Problem
par: Bošković, Borko, et autres
Publié: (2022)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Prediction-space knowledge markets for communication-efficient federated learning on multimedia tasks
par: Du, Wenzhang
Publié: (2025)

FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression
par: Yu, Zhiming, et autres
Publié: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
par: Cook, William, et autres
Publié: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)