# Big O Speedrun

Big O Speedrun tracks improved algorithmic bounds for classic problems.

## When to use this site

Use this site to compare bounds, read their assumptions and evidence, and find the original sources. Each problem page states its computation model and evidence rules. Cite the linked source and retain the stated assumptions and evidence level. Check the data update time before describing a result as current.

## Problems and sources

- [Integer Multiplication](https://bigospeedrun.com/integer-multiplication): bounds, evidence rules and source links.
- [Matrix Multiplication](https://bigospeedrun.com/matrix-multiplication): bounds, evidence rules and source links.
- [Fourier Transform](https://bigospeedrun.com/exact-dft): bounds, evidence rules and source links.
- [3SUM](https://bigospeedrun.com/3sum): bounds, evidence rules and source links.
- [APSP](https://bigospeedrun.com/apsp): bounds, evidence rules and source links.
- [Subset Sum](https://bigospeedrun.com/subset-sum): bounds, evidence rules and source links.

## Reference

- [About and evidence levels](https://bigospeedrun.com/about#evidence-levels): evidence definitions and submission guidance.
- [Structured data](https://bigospeedrun.com/chat-knowledge.json): update times, page text, evidence definitions, current leaders overall and by evidence level, their assumptions and sources, and repository submission links. This file does not contain the full record history.
- [Sitemap](https://bigospeedrun.com/sitemap.xml): public page URLs.

Request a page with Accept: text/markdown to read its Markdown representation.