Before revision:  The algorithmic aspects of CPGs are also discussed, including optimal policy factorisations, their complexity , and the use of conditioning to efficiently scale to extremely large, concurrent tasks.
After revision:  The algorithmic aspects of CPGs are also discussed, including optimal policy factorisation, as characterised by minimum biclique coverings , and the use of conditioning to efficiently scale to extremely large, concurrent tasks.