A geometrical method in combinatorial complexity

Jaroslav Morávek

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

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

A localization problem in geometry and complexity of discrete programming

Jaroslav Morávek (1972)

Kybernetika

Similarity:

Generalization of pattern recognition method in experiment analysis

Evžen Kindler (1972)

Kybernetika

Similarity:

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.