Image de couverture de livre

Partial and weighted matrix multiplication

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Vrana, Péter
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Canonization of a random graph by two matrix-vector multiplications
par: Verbitsky, Oleg, et autres
Publié: (2023)

Deterministic Weighted Automata under Partial Observability
par: Michaliszyn, Jakub, et autres
Publié: (2024)

One-Way Communication Complexity of Partial XOR Functions
par: Podolskii, Vladimir V., et autres
Publié: (2023)

Barriers for rectangular matrix multiplication
par: Christandl, Matthias, et autres
Publié: (2020)

Partial Minimum Branching Program Size Problem is ETH-hard
par: Glinskih, Ludmila, et autres
Publié: (2024)

Average-case deterministic query complexity of boolean functions with fixed weight
par: Li, Yuan, et autres
Publié: (2024)

Asymptotic tensor rank is characterized by polynomials
par: Christandl, Matthias, et autres
Publié: (2024)

Integer multiplication is at least as hard as matrix transposition
par: Harvey, David, et autres
Publié: (2025)

Quantum computational complexity of matrix functions
par: Cifuentes, Santiago, et autres
Publié: (2024)

Fast interpolation and multiplication of unbalanced polynomials
par: Giorgi, Pascal, et autres
Publié: (2024)

Efficient LP warmstarting for linear modifications of the constraint matrix
par: Derval, Guillaume, et autres
Publié: (2025)

Partial gathering of mobile agents in dynamic rings
par: Shibata, Masahiro, et autres
Publié: (2022)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

#P-hardness proofs of matrix immanants evaluated on restricted matrices
par: Miklos, Istvan, et autres
Publié: (2021)

Hardness of the Binary Covering Radius Problem in Large $\ell_p$ Norms
par: Bennett, Huck, et autres
Publié: (2026)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
par: Kowaluk, Miroslaw, et autres
Publié: (2025)

Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs
par: Kothari, Pravesh K., et autres
Publié: (2024)

The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding
par: Gu, Shouzhen, et autres
Publié: (2026)

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
par: Goyal, Rohan, et autres
Publié: (2025)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
par: Goyal, Rohan, et autres
Publié: (2023)

Pseudorandomness, symmetry, smoothing: I
par: Derksen, Harm, et autres
Publié: (2024)

Pseudorandomness, symmetry, smoothing: II
par: Derksen, Harm, et autres
Publié: (2024)

Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes
par: Grigorescu, Elena, et autres
Publié: (2025)

A quasi-optimal lower bound for skew polynomial multiplication
par: Chen, Qiyuan, et autres
Publié: (2024)

The moment polytope of matrix multiplication is not maximal
par: Berg, Maxim van den, et autres
Publié: (2025)

Multiplicative weights, equalizers, and P=PPAD
par: Avramopoulos, Ioannis
Publié: (2016)

Two weights inequality for Hankel operators on weighted Bergman spaces induced by radial weights
par: Li, Mingjin, et autres
Publié: (2025)

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications
par: Błasiok, Jarosław, et autres
Publié: (2021)

Partial Evidence Bench: Benchmarking Authorization-Limited Evidence in Agentic Systems
par: Tallam, Krti
Publié: (2026)

Fast and simple multiplication of bounded twin-width matrices
par: Kozma, László, et autres
Publié: (2026)

Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling
par: Moka, Sarat, et autres
Publié: (2026)

Macaulay representation of the prolongation matrix and the SOS conjecture
par: Wang, Zhiwei, et autres
Publié: (2025)

Generalization of Cauchy type theorems for matrix Polynomials
par: Qasim, Idrees
Publié: (2025)

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
par: Janzer, Oliver, et autres
Publié: (2024)

Explicit Commutative ROABPs from Partial Derivatives
par: Bhargava, Vishwas, et autres
Publié: (2024)

Computing Hamiltonian Paths with Partial Order Restrictions
par: Beisegel, Jesse, et autres
Publié: (2024)

Bounds for the zeros of Bicomplex Polynomials using matrix method
par: Jan, Ovaisa, et autres
Publié: (2024)

One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming
par: Das, Avinandan
Publié: (2026)

CSPs with Few Alien Constraints
par: Jonsson, Peter, et autres
Publié: (2024)

Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation
par: Jacobs, Peter Matthew, et autres
Publié: (2026)