Sbastien Tavenas on Muck Rack

Sbastien Tavenas

As seen in: Communications of the ACM
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Sbastien

Contact Sbastien, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits

|
By Nutan Limaye, Srikanth Srinivasan, Sbastien Tavenas
| Communications of the ACM Verified
a. One can also consider divisions, but they can typically be eliminated without much extra cost. b. We typically consider an infinite sequence of polynomials, a distinction that we frequently gloss over in this paper. We also require that the polynomials have only moderate degree, that is, that the degree grows at most as a polynomial function in the number of input variables. A good example to keep in mind is the problem of computing the determinant of an n × n matrix.
Open in Who Shared Issue with article?
See all 1 articles
 •  Privacy  •  Terms  •  Security and Legal  •   •   •   • 

© 2026 Muck Rack

SOC 2® Certified