e/AWPP (complexity)

New Query

Information
has glosseng: In theoretical computer science, Almost Wide Probabilistic Polynomial-Time (AWPP) is a complexity class for problems in the context of quantum computing.
lexicalizationeng: AWPP
instance ofc/Probabilistic complexity classes

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint