k-Coloring is Faster than Computing the Chromatic Number (arxiv.org)

Screenshot of arxiv.org: k-Coloring is Faster than Computing the Chromatic Number

First screen, captured 2 months ago.

Looks similar

Screenshot of arxiv.org: The k-server conjecture is true

The k-server conjecture is true (arxiv.org)

82 points by iamsyr 1 month ago | 35 comments

Screenshot of arxiv.org: The Kernighan-Lin Search Algorithm

The Kernighan-Lin Search Algorithm (arxiv.org)

48 points by optimalsolver 1 year ago | 2 comments

Screenshot of arxiv.org: Subquadratic 3SUM and Subcubic APSP

Subquadratic 3SUM and Subcubic APSP (arxiv.org)

91 points by mauriziocalo 20 days ago | 35 comments

arXiv paper by Josh Alman and Virginia Vassilevska Williams giving truly subquadratic 3SUM and truly subcubic APSP algorithms via a new thin matrix product algorithm.

3sum apsp fine-grained-complexity matrix-multiplication

Screenshot of arxiv.org: Compiler-style optimization for drawing via Skia

Compiler-style optimization for drawing via Skia (arxiv.org)

111 points by PaulDavisThe1st 1 month ago | 21 comments

$Screenshot of arxiv.org: Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-Point Hessian$

Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-Point Hessian (arxiv.org)

31 points by sbulaev 2 months ago | 12 comments

Screenshot of arxiv.org: Mathematics of Data Science

Mathematics of Data Science (arxiv.org)

186 points by Anon84 3 months ago | 11 comments

Looks similar

The k-server conjecture is true(arxiv.org)

The Kernighan-Lin Search Algorithm(arxiv.org)

Subquadratic 3SUM and Subcubic APSP(arxiv.org)

Compiler-style optimization for drawing via Skia(arxiv.org)

Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-Point Hessian(arxiv.org)

Mathematics of Data Science(arxiv.org)