Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
LIP
A Dichotomy Theorem for Polynomial Evaluation
A hitting set construction, with application to arithmetic circuit lower bounds
A quantum lower bound for the query complexity of Simon's problem
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
Arithmetic circuits: the chasm at depth four gets wider
No associations
LandOfFree
Pascal Koiran does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Pascal Koiran, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pascal Koiran will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-117650