The following pages link to Sagnik Mukhopadhyay (Q2164679):
Displaying 9 items.
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- (Q2954998) (← links)
- Lower Bounds for Elimination via Weak Regularity (Q4636619) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Weighted min-cut: sequential, cut-query, and streaming algorithms (Q5144937) (← links)
- Simulation beats richness: new data-structure lower bounds (Q5230358) (← links)
- Towards Better Separation between Deterministic and Randomized Query Complexity (Q5275368) (← links)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
