Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hi-index | 0.01 |