Definitions from Wikipedia (GapP)

▸ noun:  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.



▸ Words similar to gapp
▸ Usage examples for gapp

▸ Idioms related to gapp
▸ Wikipedia articles (New!)
▸ Popular adjectives describing gapp
▸ Words that often appear near gapp
▸ Rhymes of gapp

▸ Invented words related to gapp