✦ LIBER ✦

A polynomial-time algorithm for finding zero-sums

✍ Scribed by Alberto del Lungo; Claudio Marini; Elisa Mori

Book ID: 108114056
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 375 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.06.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asynchronous polynomial zero-finding alg

Asynchronous polynomial zero-finding algorithms

✍ T.L. Freeman; M.K. Bane 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Frequent synchronisations have a significant effect on the efficiency of parallel numerical algorithms. In this paper we consider simultaneous polynomial zero-finding algorithms and analyse, both theoretically and numerically, the effect of removing the synchronisation restriction from these algorit

A polynomial time algorithm for Zero-Cla

A polynomial time algorithm for Zero-Clairvoyant scheduling

✍ K. Subramani 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 206 KB

A Polynomial-Time Algorithm to Find von

✍ Jun Wako 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 700 KB

A polynomial time algorithm for finding

A polynomial time algorithm for finding the absolute center of a network

✍ Edward Minieka 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB

A Polynomial-Time Algorithm for Finding

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

✍ Zhivko P. Nedev; Peter T. Wood 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Stieltjes sums for zeros of orthogonal p

Stieltjes sums for zeros of orthogonal polynomials

✍ André Ronveaux; Martin E. Muldoon 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 374 KB