2012
DOI: 10.1007/s10469-012-9159-8
|View full text |Cite
|
Sign up to set email alerts
|

Generalizations of Hensel’s lemma and the nearest root method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…In a series of papers [2][3][4][5][6], separants of polynomials were found for some important (interesting) classes of polynomials. If we use the notion of a constructive model [7] or, which is equivalent, of a computable model [7,8], then it is not hard to see that in the case where F 0 is a constructive field, the definition of a separant σ f itself shows a way of computing the separant.…”
mentioning
confidence: 99%
“…In a series of papers [2][3][4][5][6], separants of polynomials were found for some important (interesting) classes of polynomials. If we use the notion of a constructive model [7] or, which is equivalent, of a computable model [7,8], then it is not hard to see that in the case where F 0 is a constructive field, the definition of a separant σ f itself shows a way of computing the separant.…”
mentioning
confidence: 99%