Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems

Sandeep Sen. Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems. Theoretical Computer Science, 188(1-2):59-78, 1997. [doi]

@article{Sen97,
  title = {Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems},
  author = {Sandeep Sen},
  year = {1997},
  doi = {10.1016/S0304-3975(96)00212-5},
  url = {http://dx.doi.org/10.1016/S0304-3975(96)00212-5},
  tags = { algebra},
  researchr = {https://researchr.org/publication/Sen97},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {188},
  number = {1-2},
  pages = {59-78},
}