Deterministic APSP, Orthogonal Vectors, and More
type: Item
instance of: scholarly article
title: Deterministic APSP, Orthogonal Vectors, and More
DOI: 10.1145/3402926
author: Timothy M. Chan
author: Ryan Williams
published in: ACM Transactions on Algorithms
publication date: 2022-02-08T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7471487
zbMATH Keywords: all-pairs shortest paths
zbMATH Keywords: derandomization
zbMATH Keywords: polynomial method
zbMATH Keywords: satisfiability
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/3402926
OpenAlex ID: W3115470548
Recommended article: Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
Recommended article: Q5460924
Recommended article: A Fast Randomized Algorithm for Orthogonal Projection
Recommended article: A fast randomized algorithm for the approximation of matrices
Recommended article: A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
Recommended article: Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm
Recommended article: An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms
Recommended article: Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
Recommended article: Derandomizing Approximation Algorithms Based on Semidefinite Programming
Recommended article: On the complexity of approximating extremal determinants in matrices
description: scientific article; zbMATH DE number 7471487