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

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 62; no. 3; pp. 622 - 652
Main Authors:	Mahajan, Meena, Saurabh, Nitin
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2018 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!