Publications associées à Notation L

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Robert Granger, Jens Markus Zumbrägel

In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as low as

L_{q^n}(1/3,(4/9)1/3)

for computing arbitrary logarithms, but also in an heuristic polynomial time alg ...

Springer Berlin Heidelberg2013

Notation L

Graph Chatbot

Chattez avec Graph Search

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

An Optimal Space Lower Bound for Approximating MAX-CUT

Indiscreet logarithms in finite fields of small characteristic

Computation of a 768-Bit Prime Field Discrete Logarithm

Principal-component analysis of two-particle azimuthal correlations in PbPb and $p\text{Pb}$ collisions at CMS

Tight Bounds for Asynchronous Renaming

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Coloring K-k-free intersection graphs of geometric objects in the plane

On the Construction of Polar Codes

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Computation of a 768-Bit Prime Field Discrete Logarithm

An Optimal Space Lower Bound for Approximating MAX-CUT

Indiscreet logarithms in finite fields of small characteristic

Tight Bounds for Asynchronous Renaming

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Coloring K-k-free intersection graphs of geometric objects in the plane

Principal-component analysis of two-particle azimuthal correlations in PbPb and $p\text{Pb}$ collisions at CMS

On the Construction of Polar Codes