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 1 of 1 for “"critical point methods"”.

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

    … bit complexity of an algorithm that computes one point per connected component in a real algebraic set. The analysis is of an algorithm by Safey El Din and Schost (Polar varieties and computation of one point in each connected component of a smooth real algebraic set). This algorithm uses random …

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