An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases

Documenti analoghi

• Optimal Parallel Basis Finding in Graphic and Related Matroids
  di: Khanna, Sanjeev, et al.
  Pubblicazione: (2025)
• On the Parallel Complexity of Finding a Matroid Basis
  di: Khanna, Sanjeev, et al.
  Pubblicazione: (2025)
• Bounded Independence Edge Sampling for Combinatorial Graph Properties
  di: Putterman, Aaron, et al.
  Pubblicazione: (2026)
• An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest Paths
  di: Khanna, Sanjeev, et al.
  Pubblicazione: (2026)
• Fault-Tolerant Distance Oracles Below the $n \cdot f$ Barrier
  di: Khanna, Sanjeev, et al.
  Pubblicazione: (2026)