Assertion: kernel | /r/AtLocation | polynomial time
Facets:
Source sentences:
text: In parameterized complexity theory, it is often possible to prove that a kernel with guaranteed bounds on the size of a kernel (as a function of some parameter associated to the problem) can be found in polynomial time.