Imagen de Portada

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Björklund, Andreas, Kaski, Petteri, Koana, Tomohiro, Nederlof, Jesper
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
por: Björklund, Andreas, et al.
Publicado: (2023)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
por: Nederlof, Jesper
Publicado: (2026)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
por: Kluk, Kacper, et al.
Publicado: (2025)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor
por: Groenland, Carla, et al.
Publicado: (2024)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2020)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

Lazy Kronecker Product
por: Song, Zhao
Publicado: (2026)

Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum
por: Alman, Josh, et al.
Publicado: (2025)

A universal sequence of tensors for the asymptotic rank conjecture
por: Kaski, Petteri, et al.
Publicado: (2024)

FPT algorithms over linear delta-matroids with applications
por: Eiben, Eduard, et al.
Publicado: (2025)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
por: Björklund, Andreas, et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
por: Nederlof, Jesper
Publicado: (2025)

Deterministic factorization of constant-depth algebraic circuits in subexponential time
por: Bhattacharjee, Somnath, et al.
Publicado: (2025)

Simple approximation algorithms for Polyamorous Scheduling
por: Biktairov, Yuriy, et al.
Publicado: (2024)

Nine lower bound conjectures on streaming approximation algorithms for CSPs
por: Singer, Noah G.
Publicado: (2025)

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
por: Dell, Holger, et al.
Publicado: (2022)

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem
por: Yang, Yang
Publicado: (2025)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
por: Yang, Yang
Publicado: (2024)

Random tensor isomorphism under orthogonal and unitary actions
por: Chizewer, Jeremy, et al.
Publicado: (2026)

A general framework for finding diverse solutions via network flow and its applications
por: Iwamasa, Yuni, et al.
Publicado: (2025)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
por: Kontogiannis, Andreas, et al.
Publicado: (2026)

Faster Edge Coloring by Partition Sieving
por: Akmal, Shyan, et al.
Publicado: (2025)

Positive bias makes tensor-network contraction tractable
por: Jiang, Jiaqing, et al.
Publicado: (2024)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
por: Sarkar, Rohit Sarma, et al.
Publicado: (2024)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
por: Koana, Tomohiro, et al.
Publicado: (2024)

Clifford testing: algorithms and lower bounds
por: Hinsche, Marcel, et al.
Publicado: (2025)

Fast quantum algorithm for differential equations
por: Bagherimehrab, Mohsen, et al.
Publicado: (2023)

Faster algorithms on linear delta-matroids
por: Koana, Tomohiro, et al.
Publicado: (2024)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
por: Abbas, Amira, et al.
Publicado: (2025)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
por: Apers, Simon, et al.
Publicado: (2021)

An efficient uniqueness theorem for overcomplete tensor decomposition
por: Koiran, Pascal
Publicado: (2024)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
por: Greilhuber, Jakob, et al.
Publicado: (2025)

The Trichotomy of Regular Property Testing
por: Bathie, Gabriel, et al.
Publicado: (2025)

Downward self-reducibility in the total function polynomial hierarchy
por: Gajulapalli, Karthik, et al.
Publicado: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
por: Fujie, Yuto, et al.
Publicado: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
por: Moroie, Gregory
Publicado: (2025)

Precoloring extension with demands on paths
por: Das, Arun Kumar, et al.
Publicado: (2025)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
por: Gholizadeh, Hossein, et al.
Publicado: (2025)