If BHP is defined over Turing machines with bounded steps, the reduction from SAT presupposes a fixed encoding scheme whose choice affects the complexity classification.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.