toIPA
Home
Blog
Category
P/poly
complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function
Pronunciation
/pi / ˈpɑli/
Categories
computational problem
complexity class