Add to ORKGAbstract. We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We discuss the key ideas that have gone into the results of the last few years
Devising an efficient deterministic – or even a non-deterministic sub-exponential time – algorithm f...
In recent years a number of algorithms have been designed for the "inverse" computational ...
We introduce a hitting set generator for Polynomial Identity Testing based on evaluations of low-deg...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
Abstract. Polynomial Identity Testing (PIT) algorithms have focussed on polynomials computed either ...
We introduce a new and very natural algebraic proof system, which has tight connections to (algebrai...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
Finding an efficient solution to the general problem of polynomial identity testing (PIT) is a chal-...
Polynomial Identity Testing (PIT) is a fundamental computational problem. The famous depth-4 reducti...
Using ideas from automata theory we design a new efficient (deterministic) identity test for the non...
Using ideas from automata theory we design a new efficient (deterministic) identity test for the non...
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithme...
Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebra...
Devising an efficient deterministic – or even a non-deterministic sub-exponential time – algorithm f...
In recent years a number of algorithms have been designed for the "inverse" computational ...
We introduce a hitting set generator for Polynomial Identity Testing based on evaluations of low-deg...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
Abstract. Polynomial Identity Testing (PIT) algorithms have focussed on polynomials computed either ...
We introduce a new and very natural algebraic proof system, which has tight connections to (algebrai...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
A few typos corrected.A polynomial identity testing algorithm must determine whether an input polyno...
Finding an efficient solution to the general problem of polynomial identity testing (PIT) is a chal-...
Polynomial Identity Testing (PIT) is a fundamental computational problem. The famous depth-4 reducti...
Using ideas from automata theory we design a new efficient (deterministic) identity test for the non...
Using ideas from automata theory we design a new efficient (deterministic) identity test for the non...
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithme...
Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebra...
Devising an efficient deterministic – or even a non-deterministic sub-exponential time – algorithm f...
In recent years a number of algorithms have been designed for the "inverse" computational ...
We introduce a hitting set generator for Polynomial Identity Testing based on evaluations of low-deg...