𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for the 3-satisfiability problem

✍ Scribed by Alain Billionnet; Alain Sutter

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
543 KB
Volume
12
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Algorithm for the Complex R
An Efficient Algorithm for the Complex Roots Problem
✍ C.Andrew Neff; John H. Reif πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ΟͺȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l