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

Combinatorial Complexity of Convex Sequences

โœ Scribed by Alex Iosevich; S. Konyagin; M. Rudnev; V. Ten


Publisher
Springer
Year
2005
Tongue
English
Weight
270 KB
Volume
35
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Complexity of convex stereohedra
โœ A. S. Tarasov ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 273 KB
Combinatorial complexity of signed discs
โœ Diane L. Souvaine; Chee-Keng Yap ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 790 KB
Communication complexity of convex optim
โœ John N Tsitsiklis; Zhi-Quan Luo ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 692 KB

We consider a situation where each of two processors has access to a different convex functionA, i = 1,2, defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which f, + h is minimized, wi