๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets

โœ Scribed by M. Yu. Khachai


Book ID
110209494
Publisher
SP MAIK Nauka/Interperiodica
Year
2008
Tongue
English
Weight
172 KB
Volume
18
Category
Article
ISSN
1054-6618

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES