✦ 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
DOI: 10.1007/s00454-005-1194-y

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

The combinatorial complexity of masterke

The combinatorial complexity of masterkeying

✍ Wolfgang Espelage; Egon Wanke 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 241 KB

Combinatorial representation and convex

Combinatorial representation and convex dimension of convex geometries

✍ Paul H. Edelman; Michael E. Saks 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 575 KB

A combinatorial approach to probabilisti

A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences

✍ Harald Niederreiter 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 339 KB

Communication complexity of convex optim

Communication complexity of convex optimization

✍ 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