Theory Seminar, Wednesday Jan 17: Ben Lee Volk (Reichman University) - Lower Bounds for Algebraic Algorithms

[Talya Eden]

Hi everyone,

Next meeting, we will have Ben Lee Volk speak at the seminar.

Reminder,  our new location is Building 503 room 226.

Title: Lower Bounds for Algebraic Algorithms

Abstract:

Algebraic Complexity Theory studies the amount of resources required by algebraic algorithms for solving algebraic computational problems, such as multiplying matrices, computing determinants or applying the discrete Fourier transform.

Much like in the parallel universe of boolean computation, the basic problems in this area are widely open and we are very far from separating "algebraic P" from "algebraic NP" or from showing even modest limitations on the power of algebraic algorithms. In this talk I will describe some efforts from recent years towards the goal of proving lower bounds for strong algebraic computational models.

Based on several joint works with Abhranil Chatterjee, Prerona Chatterjee, Mrinal Kumar and Adrian She.

[Talya Eden]

As always, we will meet at 12:00.

[Arnold Filtser]

Reminder- the seminar starts in 1 hour! (at 12)

--
You received this message because you are subscribed to the Google Groups "BIU Theory Seminar" group.
To unsubscribe from this group and stop receiving emails from it, send an email to biu-theory-semi...@cs.biu.ac.il.
To view this discussion on the web visit https://groups.google.com/a/cs.biu.ac.il/d/msgid/biu-theory-seminar/CAHYGKUzb2Kfo2QzVneRkXo_d5318wp7T8guOe%2BP6YRtOSqgQTw%40mail.gmail.com.
For more options, visit https://groups.google.com/a/cs.biu.ac.il/d/optout.