Imagen de Portada

$XX^{t}$ Can Be Faster

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Rybin, Dmitry, Zhang, Yushun, Luo, Zhi-Quan
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Artificial Intelligence Machine Learning Symbolic Computation 68Q25, 68T20 F.2.1; I.1.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
por: Khoruzhii, Kirill, et al.
Publicado: (2025)

Experimental algorithms for the dualization problem
por: Mezzini, Mauro, et al.
Publicado: (2025)

Computing bases in Hermite normal form of lattices of integer relations
por: Labahn, George, et al.
Publicado: (2026)

Discovering Algorithms with Computational Language Processing
por: Bourdais, Theo, et al.
Publicado: (2025)

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

Algorithms for Generating Small Random Samples
por: Cicirello, Vincent A.
Publicado: (2024)

Quantum Search without Global Diffusion
por: Burke, John, et al.
Publicado: (2026)

Efficient Binary Decision Diagram Manipulation in External Memory
por: Sølvsten, Steffan Christ, et al.
Publicado: (2021)

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

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

Tensor Decomposition for Non-Clifford Gate Minimization
por: Khoruzhii, Kirill, et al.
Publicado: (2026)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
por: Flouro, Aaron R., et al.
Publicado: (2026)

FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression
por: Yu, Zhiming, et al.
Publicado: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
por: Hoang, Hung P., et al.
Publicado: (2026)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
por: Sølvsten, Steffan Christ, et al.
Publicado: (2023)

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

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)

Quantum Deep Learning Still Needs a Quantum Leap
por: Gundlach, Hans, et al.
Publicado: (2025)

On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
por: Gu, Qian-Ping, et al.
Publicado: (2025)

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
por: Sølvsten, Steffan Christ, et al.
Publicado: (2024)

Many Objective Problems Where Crossover is Provably Essential
por: Opris, Andre
Publicado: (2024)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
por: Swenson, Krister M.
Publicado: (2024)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
por: Mundhra, S.
Publicado: (2025)

Overlapping Biclustering
por: Bentert, Matthias, et al.
Publicado: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
por: Kullmann, Oliver, et al.
Publicado: (2026)

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

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Space-Time Trade-off in Integer Linear Scaling Rounded to the Nearest Integer through Multiplicative and Additive Decomposition
por: Kim, Kyeong Soo
Publicado: (2026)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

Symbolic Model Checking in External Memory
por: Sølvsten, Steffan Christ, et al.
Publicado: (2025)

A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
por: Stapleton, Joshua
Publicado: (2025)

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
por: Hartman, Samuel, et al.
Publicado: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
por: Heimann, Sophia, et al.
Publicado: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

On weighted graph separation problems and flow-augmentation
por: Kim, Eun Jung, et al.
Publicado: (2022)

Optimal non-adaptive algorithm for edge estimation
por: Bishnu, Arijit, et al.
Publicado: (2025)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
por: Kosoy, Vanessa
Publicado: (2026)