In this talk we will look at $n$-variate polynomials that can be expressed as a small (poly$(n)$) sum of powers of linear polynomials. That is, polynomials that have efficient {\em depth-3-powering} circuits.

A set of polynomials is said to be algebraically independent if there is no non-zero combination of them which is zero. Testing whether a given set of polynomials is algebraically independent efficiently is open in general.

In this talk I'll be presenting the result of Beigi et.al.

Let $G$ be a directed graph on $n$ vertices (with two designated vertices $s$ and $t$) such that the edge weights of $G$ are real-valued linear functions of a parameter $\lambda$.

This talk addresses in the main the problem of secure control of networked cyber-physical systems, and, title notwithstanding, a digression into mm-wave networks that have quickly become of great topical interest since the FCC release of 10.85 GHz