Journal
PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19)
Volume -, Issue -, Pages 425-429Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3313276.3316311
Keywords
algebraic complexity; monotone computation; non negative rank
Categories
Funding
- ISF [1162/15]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
