Arrow Research search
Back to Highlights

Highlights 2016

Arithmetic Circuits: Classes, Structure, Completeness …

Conference Abstract KEYNOTE 2 (chair: Paul Gastin, room: Forum A) Logic in Computer Science · Theoretical Computer Science

Abstract

In this talk I will review recent developments in algebraic complexity theory. I will outline some major results concerning structure, completeness and closure. I will describe some techniques that have been central to obtaining these results, including extreme depth reduction, partial derivatives, and padding.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
1047161951141041434
v2026.09.13