On links between concept lattices and related complexity problems

Several notions of links between contexts, viz. intentionally related concepts, shared intents, and bonds, as well as interrelations thereof, are considered. The algorithmic complexity of the problems related to respective closure operators is studied. The expression of bonds in terms of shared intents is given.