Some Complete and Intermediate Polynomials in Algebraic Complexity Theory

We provide a list of new natural VNP-intermediate polynomial families, based on basic (combinatorial) NP-complete problems that are complete under parsimonious reductions. Over finite fields, these families are in VNP, and under the plausible hypothesis Mod p P ⫅̸ P/poly, are neither VNP-hard (even...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory of computing systems Ročník 62; číslo 3; s. 622 - 652
Hlavní autori:	Mahajan, Meena, Saurabh, Nitin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2018 Springer Nature B.V
Predmet:	Combinatorial analysis Complexity theory Computer Science Homomorphisms Lower bounds Polynomials Theory of Computation Homomorphisms Lower bounds Extension complexity VBP Completeness VP Tree decomposition VNP-intermediate Monotone projections
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!