Pages that link to "Item:Q4993299"
From MaRDI portal
The following pages link to Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299):
Displaying 7 items.
- Upper and lower I/O bounds for pebbling \(r\)-pyramids (Q450538) (← links)
- Computing the optimal IO sequences of a protocol in polynomial time (Q1183459) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- (Q4508949) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)