bn:00244011n
Noun Named Entity
Categories: Quantum complexity theory, Theoretical computer science stubs, Probabilistic complexity classes
EN
AWPP  almost wide probabilistic polynomial-time
EN
In theoretical computer science, almost wide probabilistic polynomial-time is a complexity class contained in PP defined via GapP functions. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
In theoretical computer science, almost wide probabilistic polynomial-time is a complexity class contained in PP defined via GapP functions. Wikipedia
Wikipedia
EN
Wikidata
EN