Question

In 2021, the first superpolynomial lower bounds for certain constant-depth algebraic circuits were proven by two scientists from this country and Sébastien Tavenas. A computer scientist from this country is the second namesake of a result that gives a randomized reduction from SAT to Unambiguous-SAT. The book Computational Complexity: A Modern Approach was written by Boaz Barak (15[1])and an American computer scientist born in this country. (15[1])The “isolation lemma” in randomized algorithms was introduced by three people from this country, one of whom used it to prove a theorem co-named for him and Leslie (*) Valiant. Three scientists from this country proved that primality testing can be done (10[1])in polynomial time with their namesake AKS algorithm. For 10 points, most computer scientists in what country work in one of its IIT universities? ■END■ (10[2])

Buzzes

Summary