1 paper
Martin KoláÅ
The definition of \NP\ requires, for each member language~L, a polynomial-time checking relation~R and a constant~k such that $w \in L \iff \exists y\,(|y| \leq |w|^k \wedge…