Definition
C-hard Decision Problem
A decision problem
is hard w.r.t. a complexity class if every decision problem in can be reduced to , i.e., where
denotes many-one reducibility.
C-hard Decision Problem
A decision problem
is hard w.r.t. a complexity class if every decision problem in can be reduced to , i.e., where
denotes many-one reducibility.