Displaying similar documents to “A geometrical method in combinatorial complexity”

On the complexity of discrete programming problems

Jaroslav Morávek (1969)

Aplikace matematiky

Similarity:

The paper is a contribution to the general theory of problems of discrete programming. Particularly, the difficulties of such problems are investigated by theoretical means.