On the maximum computing time of the bisection method for real root isolation (Q507151): Difference between revisions

@@ Property / describes a project that uses @@
+ISOLATE
@@ Property / describes a project that uses: ISOLATE / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jsc.2016.02.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2307018641
@@ Property / OpenAlex ID: W2307018641 / rank @@
+Normal rank
@@ Property / cites work @@
+Continued fraction real root isolation using the Hong root bound
+Normal rank
@@ Property / cites work @@
+On the computing time of the continued fractions method
+Normal rank
@@ Property / cites work @@
+Almost tight recursion tree bounds for the Descartes method
+Normal rank
@@ Property / cites work @@
+Q3259107
@@ Property / cites work: Q3259107 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4391224
@@ Property / cites work: Q4391224 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5797046
@@ Property / cites work: Q5797046 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3933736
@@ Property / cites work: Q3933736 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient isolation of polynomial's real roots.
@@ Property / cites work: Efficient isolation of polynomial's real roots. / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:507151