𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of algorithms for the translation of polynomials

✍ Scribed by A. G. Akritas; S. D. Danielopoulos

Publisher
Springer Vienna
Year
1980
Tongue
English
Weight
444 KB
Volume
24
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Complexity of Exclusion Algorithm
On the Complexity of Exclusion Algorithms for Optimization
✍ Eugene Allgower; Melissa Erdmann; Kurt Georg πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 133 KB

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa

On the Deterministic Complexity of Facto
On the Deterministic Complexity of Factoring Polynomials
✍ Shuhong Gao πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 345 KB

The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of and , the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting

On the complexity of admissible search a
On the complexity of admissible search algorithms
✍ Alberto Martelli πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 788 KB

This paper analyzes the complexity of heuristic search algorithms, Le. algorithms which find the shortest path in a graph by using an estimate to guide the search. In particular, .algorithm A\*, due to Hart, Nilsson and Raphael, is shown to require 0(2 ~) steps, in the worst cdse, for searching a gr