For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph...
In a previous paper with M. Dzamonja, class forcings were given which fixed the complexity (a universality covering number) for certain types of structures of size together with ...
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as s...
The objective of this pal)er is to [brmalize the intuition al)out l,he comph;xity of syntactic structures. We propose a definition of structm:al COml)h'xity such that sentenc...