Is it known if $ mathrm {NP subseteq P / poly} $?


It is not immediately clear to me whether this statement is true or false. Can finite constraints of NP problems be calculated in polynomial time?