Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Bit Complexity"”.

  1. On the complexity of feasibility, connectivity, and $2^a$-isogeny computation

    … elliptic curves. This thesis investigates complexity in computational algebraic geometry, particularly bit-complexity questions in real algebraic geometry, and 2^a-isogeny computation on Legendre curves. Analyzing the bit complexity enables the development of modular extensions that manage …

    waterloo Repository record for On the complexity of feasibility, connectivity, and $2^a$-isogeny computation (opens in a new tab)

  2. Analysis of Randomized Algorithms in Real Algebraic Geometry

    … cost of the algorithm was given in an algebraic complexity model, and the analysis of the bit complexity and the error probability were left for future work. We also consider another algorithm that solves a special case of the problem. Namely, when the algebraic set is a compact hypersurface. We …

    waterloo Repository record for Analysis of Randomized Algorithms in Real Algebraic Geometry (opens in a new tab)

  3. Algorithms for Drinfeld Modules

    … also prove their correctness and analyze their bit complexity. In addition, we analyze algorithms for computing basis representations for the space of morphisms between Drinfeld modules derived from pre-existing approaches described in the literature.

    waterloo Repository record for Algorithms for Drinfeld Modules (opens in a new tab)

  4. Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems

    … quality and running time. We analyze the bit complexity and stability of efficient algorithms for problems including linear regression, $p$-norm regression, and linear programming by showing that a common subroutine, inverse maintenance, is backward stable and that iterative approaches for …

    gatech Repository record for Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems (opens in a new tab)

  5. Robust algebraic methods for geometric computing

    … practical experiments, we provide theoretical bit complexity estimates, as well as bounds in the real RAM model, by means of real condition numbers. A main bottleneck for any real solving method is singular isolated points. We employ local inverse systems and certified numerical computations to …

    greece Repository record for Robust algebraic methods for geometric computing (opens in a new tab)