Binary relations

mathematical relationship asserting that two quantities have the same value

set of ordered pairs with first element in A and second element in B

set ordered by a transitive, antisymmetric, and reflexive binary relation

mathematical concept

equivalence relation in algebra

relation that occurs when the order of the elements in a given relation is switched

preordered set whose every finite subset has an upper bound

operation on binary relations

operation on binary relations

property of parallel segments that have the same length and the same direction

two related operations on a poset in order theory

operation on binary relations

category of sets and relations

modal logic relationship

In computational complexity theory, the complexity class TFNP is the class of total function problems that can be solved in nondeterministic polynomial time. That is, it is the class of function problems that are guaranteed to have an answer, and this answer can be checked in polynomial time, or equivalently it is the subset of FNP where a solution is guaranteed to exist. The abbreviation TFNP stands for "Total Function Nondeterministic Polynomial".