Pages that link to "Item:Q4554074"
From MaRDI portal
The following pages link to Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074):
Displaying 16 items.
- More on change-making and related problems (Q2051861) (← links)
- The grid based approach, a fast local evaluation technique for line planning (Q2095522) (← links)
- Improved bounds for rectangular monotone min-plus product and applications (Q2681403) (← links)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
- (Q5093402) (← links)
- (Q5140838) (← links)
- (Q5874497) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5919104) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
- A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)
