Imagen de Portada

On Matrix Multiplication and Polynomial Identity Testing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Andrews, Robert
Formato:	Preprint
Publicado:	2022
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient Polynomial Identity Testing Over Nonassociative Algebras
por: Mukhopadhyay, Partha, et al.
Publicado: (2025)

Polynomial-Time PIT from (Almost) Necessary Assumptions
por: Andrews, Robert, et al.
Publicado: (2025)

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
por: Černý, Marek, et al.
Publicado: (2025)

Polynomial Identity Testing and Reconstruction for Depth-4 Powering Circuits of High Degree
por: Shpilka, Amir, et al.
Publicado: (2026)

Algebraic Pseudorandomness in $VNC^0$
por: Andrews, Robert
Publicado: (2025)

Improving the Leading Constant of Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2024)

An Improved Construction of Variety-Evasive Subspace Families
por: Andrews, Robert, et al.
Publicado: (2026)

Polynomial Identity Testing via Evaluation of Rational Functions
por: Hu, Ivan, et al.
Publicado: (2022)

Constant-Depth Arithmetic Circuits for Linear Algebra Problems
por: Andrews, Robert, et al.
Publicado: (2024)

Complex to Rational Fast Matrix Multiplication
por: Moran, Yoav, et al.
Publicado: (2026)

Matrix Multiplication in the MPC Model
por: Joshi, Lakshya, et al.
Publicado: (2025)

Ruling Out Low-rank Matrix Multiplication Tensor Decompositions with Symmetries via SAT
por: Yang, Jason
Publicado: (2024)

Testing Isomorphism of Graphs in Polynomial Time
por: Xue, Rui
Publicado: (2023)

Identity Testing for Radical Expressions
por: Balaji, Nikhil, et al.
Publicado: (2022)

Persistent (Co)Homology in Matrix Multiplication Time
por: Morozov, Dmitriy, et al.
Publicado: (2024)

A New Reduction Method from Multivariate Polynomials to Univariate Polynomials
por: Wang, Cancan, et al.
Publicado: (2024)

Modular composition & polynomial GCD in the border of small, shallow circuits
por: Andrews, Robert, et al.
Publicado: (2025)

Hilbert's Nullstellensatz is in the Counting Hierarchy
por: Andrews, Robert, et al.
Publicado: (2026)

On the Right Eigenvalues of the Quaternionic Matrix Polynomials
por: Jan, Ovaisa, et al.
Publicado: (2026)

Fast Matrix Multiplication meets the Submodular Width
por: Abo-Khamis, Mahmoud, et al.
Publicado: (2024)

More Asymmetry Yields Faster Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2024)

A Polynomial Time Algorithm for 3SAT
por: Quigley, Robert
Publicado: (2024)

Lifting with Inner Functions of Polynomial Discrepancy
por: Manor, Yahel, et al.
Publicado: (2024)

Symmetric Algebraic Circuits and Homomorphism Polynomials
por: Dawar, Anuj, et al.
Publicado: (2025)

On Boolean PCSPs with Polynomial Threshold Polymorphisms
por: Michno, Katzper
Publicado: (2025)

Attacking the Polynomials in the Maze of Finite Fields problem
por: Barbero, Àngela, et al.
Publicado: (2026)

One-Way Functions and Polynomial Time Dimension
por: Nandakumar, Satyadev, et al.
Publicado: (2024)

Computing the Elementary Symmetric Polynomials in Positive Characteristics
por: Orzel, Ian
Publicado: (2025)

On Factorization of Sparse Polynomials of Bounded Individual Degree
por: Chuyoon, Aminadav, et al.
Publicado: (2026)

On Efficient Noncommutative Polynomial Factorization via Higman Linearization
por: Arvind, V., et al.
Publicado: (2022)

Almost Polynomial Factor Inapproximability for Parameterized k-Clique
por: S., Karthik C., et al.
Publicado: (2021)

Extractors for Polynomial Sources over $\mathbb{F}_2$
por: Chattopadhyay, Eshan, et al.
Publicado: (2023)

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
por: Dutta, Pranjal, et al.
Publicado: (2024)

Bounds for the Zeros of Quaternionic Polynomials via Matrix Methods
por: Jan, Ovaisa, et al.
Publicado: (2026)

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
por: Komarath, Balagopal, et al.
Publicado: (2025)

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
por: Cai, Jin-Yi, et al.
Publicado: (2024)

A Refined Laser Method and Faster Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2020)

Segmented Operations using Matrix Multiplications
por: Sobczyk, Aleksandros, et al.
Publicado: (2025)

Polynomial Equivalence of Extended Chemical Reaction Models
por: Bajaj, Divya, et al.
Publicado: (2025)

Low-Degree Polynomials Are Good Extractors
por: Alrabiah, Omar, et al.
Publicado: (2024)