Exact Matching in Matrix Multiplication Time

2025-08-06

AI Summary

This paper addresses the Exact Matching problem, presenting the first algorithm with asymptotic time complexity matching that of matrix multiplication—namely, $O(n^omega)$ where $omega < 2.373$. Methodologically, it pioneers the systematic application of algebraic techniques—specifically randomized construction and fast computation of matrix characteristic polynomials—to this problem: a weighted adjacency matrix is constructed, and its determinant’s vanishing pattern is analyzed to probabilistically decide matching existence with high confidence. Key contributions are: (1) reducing the best-known upper bound on exact matching from $O(n^4)$ to $O(n^omega)$; (2) establishing a general algebraic framework extendable to broader combinatorial structures, including linear matroid intersection; and (3) providing a critical breakthrough toward resolving the long-standing open question of whether exact matching admits a polynomial-time algorithm.

Technology Category

• Machine Learning: Matrix & Tensor Methods
• Search and Optimization: Combinatorial Optimization
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Web Mining and Content Analysis: Robustness and generalizability of Web mining methods
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments

Abstract

Initiated by Mulmuley, Vazirani, and Vazirani (1987), many algebraic algorithms have been developed for matching and related problems. In this paper, we review basic facts and discuss possible improvements with the aid of fast computation of the characteristic polynomial of a matrix. In particular, we show that the so-called exact matching problem can be solved with high probability in asymptotically the same time order as matrix multiplication. We also discuss its extension to the linear matroid parity problem.

Problem

• Solve exact matching problem efficiently
• Achieve matrix multiplication time complexity
• Extend solution to matroid parity

Innovation

• Fast characteristic polynomial computation
• Exact matching via matrix multiplication
• Extension to linear matroid parity