Under the auspices of the Computational Complexity Foundation (CCF)
This work is about the monotone versions of the algebraic complexity classes VP and VNP. The main result is that monotone VNP is strictly stronger than monotone VP.
