Root-neededness and approximations of neededness
From MaRDI portal
Publication:293367
DOI10.1016/S0020-0190(98)00118-5zbMATH Open1339.68139OpenAlexW1971837177MaRDI QIDQ293367FDOQ293367
Authors: Salvador Lucas 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001185?np=y
Recommendations
- On the Complexity of Reliable Root Approximation
- From approximate factorization to root isolation
- A property of the nearly optimal root-bound
- Approximated roots, generating sequences, sufficiency of jets
- On the quality of some root-bounds
- Rationalizing roots: an algorithmic approach
- scientific article; zbMATH DE number 953047
- The ROOTS Constraint
- scientific article; zbMATH DE number 7448576
- Topological complexity of a root finding algorithm
Cites Work
- Sequentiality in orthogonal term rewriting systems
- LEAN: An intermediate language based on graph rewriting
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Title not available (Why is that?)
- Decidable approximations of term rewriting systems
- Decidable call by need computations in term rewriting (extended abstract)
Cited In (2)
This page was built for publication: Root-neededness and approximations of neededness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293367)
