In this section we explain the precise complexity problem studied by the GCT program,
namely ¯¯¯¯¯¯¯¯¯¯¯¯VPws≠VNP,
and place it in the context of Valiant’s
algebraic model of NP-completeness [63, 64].
In particular, we compare this to the conjecture…