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

Polynomial Time Algorithms for Determining Optimal Strategies

โœ Scribed by Dmitrii Lozovanu; Stefan Pickl

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
247 KB
Volume
13
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal algorithms for parallel polynomi
Optimal algorithms for parallel polynomial evaluation
โœ Ian Munro; Michael Paterson ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[Iog2 k], an algorithm given is within one time unit of optimality.

Polynomial time algorithms for three-lab
Polynomial time algorithms for three-label point labeling
โœ Rob Duncan; Jianbo Qian; Antoine Vigneron; Binhai Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 155 KB

In this paper, we present an O(n 2 log n) time solution for the following multi-label map labeling problem: given a set S of n distinct sites in the plane, place at each site a triple of uniform squares of maximum possible size such that all the squares are axis-parallel and a site is on the boundar