Displaying similar documents to “A general framework for subexponential discrete logarithm algorithms”

The product of two ordinals is hereditarily dually discrete

M.Á. Gaspar-Arreola, F. Hernández-Hernández (2012)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In Dually discrete spaces, Topology Appl. 155 (2008), 1420–1425, Alas et. al. proved that ordinals are hereditarily dually discrete and asked whether the product of two ordinals has the same property. In Products of certain dually discrete spaces, Topology Appl. 156 (2009), 2832–2837, Peng proved a number of partial results and left open the question of whether the product of two stationary subsets of ω 1 is dually discrete. We answer the first question affirmatively and as a consequence...

Integer factorization and discrete logarithm problems

Pierrick Gaudry (2014)

Les cours du CIRM

Similarity:

These are notes for a lecture given at CIRM in 2014, for the “Journées Nationales du Calcul Formel”. We explain the basic algorithms based on combining congruences for solving the integer factorization and the discrete logarithm problems. We highlight two particular situations where the interaction with symbolic computation is visible: the use of Gröbner basis in Joux’s algorithm for discrete logarithm in finite field of small characteristic, and the exact sparse linear algebra tools...

A remark on genotype selection in plant breeding projects

Ewa Bakinowska, Andrzej Bichoński, Radosław Kala, Bogna Zawieja (2015)

Biometrical Letters

Similarity:

One of the main problems in plant breeding is the selection of the best genotypes. Most often the selection is made using yield as a main trait of continuous type, and ignoring the other traits of discrete type. Here, a simple procedure is proposed for dealing with the selection problem using not only the yield, but also an auxiliary discrete trait. The method is based on transforming the continuous variable into a discrete one and testing the dependence of variables with the use of...