✦ LIBER ✦

An improvement of the complexity bound for solving systems of polynomial equations

✍ Scribed by A. L. Chistov

Book ID: 113072779
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 235 KB
Volume: 181
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-012-0724-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Solving Polynomial Equ

The Complexity of Solving Polynomial Equations by Prime Root Extractions

✍ Gati, Georg 📂 Article 📅 1983 🏛 Society for Industrial and Applied Mathematics ⚖ 216 KB

Improving a method of search for solving

Improving a method of search for solving polynomial equations

✍ M. Hujter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 136 KB

This paper is related to the Lehmer-Schur methods in numerical mathematics in the complex plane. It is shown that by a slight modification of the "optimized" Lehmer-Schur method of Gal~ntai, the "speed" quotient 0.6094 can be reduced to 0.5758. The crucial idea is based on a discrete geometrical obs

A polynomial algorithm for solving syste

A polynomial algorithm for solving systems of two linear diophantine equations

✍ Jean-François Romeuf 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 987 KB

Investigation of a subdivision based alg

Investigation of a subdivision based algorithm for solving systems of polynomial equations

✍ Jürgen Garloff; A.P. Smith 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 381 KB

Improved bounds for the recursion width

Improved bounds for the recursion width in congruent type methods for solving systems of linear equations

✍ Kh. D. Ikramov 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 182 KB

Dichotomies in the Complexity of Solving

Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups

✍ O. Klima; P. Tesson; D. Therien 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 370 KB