On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz

Computational Complexity Conference, pp. 30:1-30:24, 2017.

Cited by: 10|Bibtex|Views29|Links
EI

Abstract:

The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but only a few of these are known to be complete in the class. Before this work, the known complete proble...More

Code:

Data:

Your rating :
0

 

Tags
Comments