Pages that link to "Item:Q5230293"
From MaRDI portal
The following pages link to Fine-grained complexity for sparse graphs (Q5230293):
Displaying 5 items.
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)