Separating monotone VP and VNP

Amir Yehudayoff

doi:10.1145/3313276.3316311

Separating monotone VP and VNP

Amir Yehudayoff

Mathematics

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
Editors	Moses Charikar, Edith Cohen
Pages	425-429
Number of pages	5
ISBN (Electronic)	9781450367059
DOIs	https://doi.org/10.1145/3313276.3316311
State	Published - 23 Jun 2019
Event	51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 - Phoenix, United States Duration: 23 Jun 2019 → 26 Jun 2019

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing

Conference

Conference	51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019
Country/Territory	United States
City	Phoenix
Period	23/06/19 → 26/06/19

Keywords

Algebraic complexity
Monotone computation
Non negative rank

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.1145/3313276.3316311

Cite this

@inproceedings{938f0152eca54d0ca5b88ef164c4e186,

title = "Separating monotone VP and VNP",

abstract = "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.",

keywords = "Algebraic complexity, Monotone computation, Non negative rank",

author = "Amir Yehudayoff",

note = "Publisher Copyright: {\textcopyright} 2019 Association for Computing Machinery.; 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 ; Conference date: 23-06-2019 Through 26-06-2019",

year = "2019",

month = jun,

day = "23",

doi = "10.1145/3313276.3316311",

language = "الإنجليزيّة",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "425--429",

editor = "Moses Charikar and Edith Cohen",

booktitle = "STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing",

}

Yehudayoff, A 2019, Separating monotone VP and VNP. in M Charikar & E Cohen (eds), STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 425-429, 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, United States, 23/06/19. https://doi.org/10.1145/3313276.3316311

TY - GEN

T1 - Separating monotone VP and VNP

AU - Yehudayoff, Amir

PY - 2019/6/23

Y1 - 2019/6/23

N2 - 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.

AB - 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.

KW - Algebraic complexity

KW - Monotone computation

KW - Non negative rank

UR - http://www.scopus.com/inward/record.url?scp=85068750246&partnerID=8YFLogxK

U2 - 10.1145/3313276.3316311

DO - 10.1145/3313276.3316311

M3 - منشور من مؤتمر

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 425

EP - 429

BT - STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing

A2 - Charikar, Moses

A2 - Cohen, Edith

T2 - 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019

Y2 - 23 June 2019 through 26 June 2019

ER -

Separating monotone VP and VNP

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this