The Computational Complexity of Continued Fractions
From MaRDI portal
Recommendations
Cited in
(57)- Rank and optimal computation of generic tensors
- Quasi-gcd computations
- Irreducibility of multivariate polynomials
- On the limits of computations with the floor function
- Cauchy index computation
- Multiplicative complexity of some rational functions
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem
- New combinations of methods for the acceleration of matrix multiplication
- Direct sums of bilinear algorithms
- On the complexity of simplifying quadratic forms
- Computing lower bounds on tensor rank over finite fields
- Fast matrix multiplication without APA-algorithms
- Parallel information-based complexity
- Test complexity of generic polynomials
- A note of best fractions of a computable real number
- Verification complexity of linear prime ideals
- On the optimal computation of a set of symmetric and persymmetric bilinear forms
- On the parallel complexity of the polynomial ideal membership problem
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- An optimal bound for path weights in Huffman trees
- Subresultants revisited.
- Complexity lower bounds for approximation algebraic computation trees
- On the complexity of the Lickteig-Roy subresultant algorithm
- Lower bound for the approximative complexity
- Decision trees: Old and new results.
- Semi-algebraic decision complexity, the real spectrum, and degree
- A fast version of the Schur-Cohn algorithm.
- Analysis of generalized continued fraction algorithms over polynomials
- Piecewise algebraic functions
- Computing Frobenius maps and factoring polynomials
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
- Fast computation of continued fraction expansions.
- Boolean circuits versus arithmetic circuits
- A tight bound for approximating the square root
- Polynomial factorization over ${\mathbb F}_2$
- scientific article; zbMATH DE number 4173059 (Why is no real title available?)
- On the continued fraction and Berlekamp's algorithm (Corresp.)
- Some spectral formulas for systems and transmission lines
- Complexity of computation in finite fields
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
- On the computing time of the continued fractions method
- scientific article; zbMATH DE number 1552278 (Why is no real title available?)
- scientific article; zbMATH DE number 1738584 (Why is no real title available?)
- Transmutation for systems by spectral methods
- Computing special powers in finite fields
- Evaluation of rational functions
- The repetends of reduced fractions a/b^k approach full complexity with an increasing k
- The complexity of error-correcting codes
- Length of the continued logarithm algorithm on rational inputs
- Sylvester-Habicht sequences and fast Cauchy index computation
- Fast norm computation in smooth-degree abelian number fields
- Algebraic decision trees and Euler characteristics
- Some computational problems in linear algebra as hard as matrix multiplication
- Early termination for sparse interpolation of polynomials in Chebyshev bases
- Fast computation of periodic continued fractions
- Analysis of Euclidean algorithms for polynomials over finite fields
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
This page was built for publication: The Computational Complexity of Continued Fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332243)
