✦ LIBER ✦

On the computational complexity of piecewise-linear homotopy algorithms

✍ Scribed by Michael J. Todd

Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 535 KB
Volume: 24
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01585104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of a piecewise linear

On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials

✍ James Renegar 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 672 KB

On computational efficiency of linear fi

On computational efficiency of linear filtering algorithms

✍ I.A. Gura; A.B. Bierman 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 903 KB

Toward mechanical analysis of the comput

Toward mechanical analysis of the computational complexity of algorithms

✍ G. P. Kozhevnikova 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 882 KB

The Computational Complexity of Some Pro

The Computational Complexity of Some Problems of Linear Algebra

✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

On the complexity of a PL homotopy algor

On the complexity of a PL homotopy algorithm for zeros of polynomials

✍ Tang'an Gao; Zeke Wang 📂 Article 📅 1993 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 382 KB

Study of the computational complexity of

Study of the computational complexity of algorithms in multidimensional digital signal processing

✍ I. Pitas 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 96 KB