I'm learning algorithm theory and the teacher asked a question that confuses me.
Do $A$ and $B$ exist such that $A$ is not truth-table reducible to $B$, but $B$ is truth-table reducible to $A$?
I'm learning algorithm theory and the teacher asked a question that confuses me.
Do $A$ and $B$ exist such that $A$ is not truth-table reducible to $B$, but $B$ is truth-table reducible to $A$?