Pages that link to "Item:Q3332243"
From MaRDI portal
The following pages link to The Computational Complexity of Continued Fractions (Q3332243):
Displaying 50 items.
- A tight bound for approximating the square root (Q287183) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- On the computing time of the continued fractions method (Q438690) (← links)
- Algebraic decision trees and Euler characteristics (Q673780) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Fast computation of periodic continued fractions (Q750520) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Rank and optimal computation of generic tensors (Q1051066) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- On the limits of computations with the floor function (Q1112603) (← links)
- Cauchy index computation (Q1127957) (← links)
- Multiplicative complexity of some rational functions (Q1141478) (← links)
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952) (← links)
- New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
- Direct sums of bilinear algorithms (Q1157377) (← links)
- On the complexity of simplifying quadratic forms (Q1157964) (← links)
- Computing lower bounds on tensor rank over finite fields (Q1165577) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- Parallel information-based complexity (Q1186504) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- A note of best fractions of a computable real number (Q1201155) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- On the optimal computation of a set of symmetric and persymmetric bilinear forms (Q1257950) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- An optimal bound for path weights in Huffman trees (Q1332764) (← links)
- Subresultants revisited. (Q1401299) (← links)
- Complexity lower bounds for approximation algebraic computation trees (Q1578509) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Lower bound for the approximative complexity (Q1822498) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
- Piecewise algebraic functions (Q2277540) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
- Fast computation of continued fraction expansions. (Q2548173) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- Some spectral formulas for systems and transmission lines (Q3720962) (← links)
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2 (Q4235525) (← links)
- (Q4524517) (← links)
- (Q4529900) (← links)
- Transmutation for systems by spectral methods (Q4727565) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- The repetends of reduced fractions $a/b^k$ approach full complexity with an increasing $k$ (Q5042434) (← links)
- The complexity of error-correcting codes (Q5055921) (← links)
- Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709) (← links)
