I an trying to learn about $DisNP$ Complexity class. I couldn't find this class in any book. But, regarding it, I found this definition in a paper:
Definition: A disjoint NP-pair (NP-pair for short) is a pair of nonempty sets $A$ and $B$ such that $A, B \in NP$ and $A \cap B = Empty$. $DisNP$ denote the class of all disjoint NP-pairs.
Now I am aware that when a problem like $SAT$ etc. is said to be in $NP$, it means that assuming we have a NDTM we can get the solution in polynomial time. Or in other words, if we can guess the solution, then the verification takes polynomial time.
But, what does it mean when we say a set $A \in NP$ or a set $B \in P$.
Does the elements of the sets represent the solution for which the corresponding $SAT$ instance for each set is true i.e. set $A$ and $B$ contain the solutions of some $SAT$ instances $SAT_A$ and $SAT_B$ such that $SAT_A$ is satisfiable iff its solution is in the set $A$?
I am not clear how we use sets (which I assume have binary strings) for defining $P, NP, NPC$?