Pages that link to "Item:Q4571929"
From MaRDI portal
The following pages link to Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929):
Displaying 11 items.
- Percolation centrality via Rademacher Complexity (Q2091801) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Finding the largest triangle in a graph in expected quadratic time (Q2184135) (← links)
- (Q5091155) (← links)
- (Q5140838) (← links)
- (Q5158499) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
