Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants (Q6752894)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: [[]] |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants |
scientific article from arXiv |
Statements
math.CO
0 references
2024
0 references