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

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems

โœ Scribed by K. A. Ariyawansa; P. L. Jiang


Book ID
111561792
Publisher
Springer
Year
2000
Tongue
English
Weight
100 KB
Volume
107
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES