is a non-trivial generalized polynomial identity for I and so also for R (see (4)).

Some topics examined include faster generation of random spanning trees, linear systems over composite moduli, instance-optimal geometric algorithms, randomized self-assembly for exact shapes, and blackbox polynomial identity testing for Depth 3 circuits.

Other topics include hardness amplification within NP deterministic algorithms, a direct product theorem for discrepancy, black box polynomial identity testing, and detecting rational points on hypersurfaces over finite fields.