Name
Year | Venue | Keywords |
|---|---|---|
2010 | Electronic Colloquium on Computational Complexity (ECCC) | divide and conquer |
Field | DocType | Volume |
Graph,Approximation algorithm,Discrete mathematics,Combinatorics,Exponential function,Constraint graph,Algorithm,Metric space,Divide and conquer algorithms,Time complexity,Completeness (statistics),Mathematics | Journal | 17 |
Citations | PageRank | References |
5 | 0.58 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjeev Arora | 1 | 4508 | 379.31 |
| Russell Impagliazzo | 2 | 5444 | 482.13 |
| William Matthews | 3 | 5 | 0.58 |
| David Steurer | 4 | 934 | 44.91 |