On the communication complexity of read-once AC O formulaeT.S. JayramSwastik Koppartyet al.2009CCC 2009Conference paper
An almost optimal rank bound for Depth-3 identitiesNitin SaxenaC. Seshadhri2009CCC 2009Conference paper