GapP
http://dbpedia.org/resource/GapP an entity of type: WikicatComplexityClasses
GapP is a counting complexity class, consisting of all of the functions f such that there exists a polynomial-time non-deterministic Turing machine M where, for any input x, f(x) is equal to the number of accepting paths of M minus the number of rejecting paths of M. GapP is exactly the closure of #P under subtraction. It also has all the other closure properties of #P, such as addition, multiplication, and binomial coefficients. The counting class AWPP is defined in terms of GapP functions.
rdf:langString
rdf:langString
GapP
xsd:integer
4788155
xsd:integer
958870361
rdf:langString
GapP is a counting complexity class, consisting of all of the functions f such that there exists a polynomial-time non-deterministic Turing machine M where, for any input x, f(x) is equal to the number of accepting paths of M minus the number of rejecting paths of M. GapP is exactly the closure of #P under subtraction. It also has all the other closure properties of #P, such as addition, multiplication, and binomial coefficients. The counting class AWPP is defined in terms of GapP functions.
xsd:nonNegativeInteger
955