Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
The scheme complexity of discrete optimization
-
AL. A MARKOV
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1993
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On transportation polytopes with the minimum number of k-faces
- The scheme complexity of discrete optimization
- On the Slupecki classes in the systems Pkx ... x Pl
- On the number of summands in the Hilbert-Kamke problem in prime numbers
- On a classification of quasigroups by properties of their T-partitions
- An asymptotic formula for the number of identity graphs
- On the entropy values of hereditary classes of graphs
- Random minimal coverings of sets
- Some classes of substitutions with cycle lengths from a given set
- Allocations with reflection, waiting time
Artikel in diesem Heft
- On transportation polytopes with the minimum number of k-faces
- The scheme complexity of discrete optimization
- On the Slupecki classes in the systems Pkx ... x Pl
- On the number of summands in the Hilbert-Kamke problem in prime numbers
- On a classification of quasigroups by properties of their T-partitions
- An asymptotic formula for the number of identity graphs
- On the entropy values of hereditary classes of graphs
- Random minimal coverings of sets
- Some classes of substitutions with cycle lengths from a given set
- Allocations with reflection, waiting time
