It cannot be verified in polynomial time.

All instances of the problem are tractable via dynamic programming.

It is guaranteed to have a linear-time approximation algorithm.

It can be solved in polynomial time.

It is in NP, and every problem in NP can be reduced to it in polynomial time.

Happy

Mad

Sad

Releaved

No

Yes, Elaine helps

Yes, George helps

Yes, Kramer helps

Scared that Roy is eating too much again

She finally admits that she prefers Jerry

She wants to go, but now with Roy

She simply needs a vacation

The art won't go up in value

He will be able to get more art

Relieved that Roy is okay

Ruin his chance with Elaine

Gipple

Doloris

Regina

Mulva

It fell and hit the doctor

Nothing special

It fell and hit the respirator

It fell into the patient

He doesn't really like her

He doesn't know her name

He forgot the date was today

She is an artist too

Seeing the operation

Asking some questions

Meeting the doctor

Getting some gloves

A car brand

Nothing really

A known food brand

A female body part