The following pages link to Sanjeev Mahajan (Q751277):
Displaying 12 items.
- (Q677990) (redirect page) (← links)
- Using amplification to compute majority with small majority gates (Q677991) (← links)
- Server problems and resistive spaces (Q751278) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- (Q3129926) (← links)
- (Q4231921) (← links)
- (Q4263472) (← links)
- Derandomizing Approximation Algorithms Based on Semidefinite Programming (Q4268812) (← links)
- The Cost of Derandomization: Computability or Competitiveness (Q4337632) (← links)
- Approximate hypergraph coloring (Q4375639) (← links)
- Vertex partitioning problems on partial k-trees (Q4375643) (← links)
- Semidefinite programming and its applications to NP problems (Q6085755) (← links)
