Boundaries of VP and VNP

DOI10.4230/LIPIcs.ICALP.2016.34zbMath1388.68076arXiv1605.02815OpenAlexW2962995120MaRDI QIDQ4598170

Youming Qiao, Joshua A. Grochow, Ketan D. Mulmuley

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1605.02815

zbMATH Keywords

arithmetic circuitgeometric complexity theoryborder complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

A note on VNP-completeness and border complexity ⋮ Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ On the closures of monotone algebraic classes and variants of the determinant ⋮ Unnamed Item ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models ⋮ Unnamed Item

This page was built for publication: Boundaries of VP and VNP