A Szemeredi-Trotter type theorem, sum-product estimates in finite quasifields, and related results
Publications associées (33)
Graph Chatbot
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.
For q a prime power, the discrete logarithm problem (DLP) in Fq consists in finding, for any g∈Fq× and h∈⟨g⟩, an integer x such that gx=h. We present an algorithm for computing discrete log ...
In 2013 the Discrete Logarithm Problem in finite fields of small characteristic enjoyed a rapid series of developments, starting with the heuristic polynomial-time relation generation method due to Gologlu, Granger, McGuire and Zumbragel, and culminating w ...
We establish exponential convergence of the hp-version of isogeometric analysis for second order elliptic problems in one spacial dimension. Specifically, we construct, for functions which are piecewise analytic with a finite number of algebraic singularit ...
Let G be a simple algebraic group defined over a finite field of good characteristic, with associated Frobenius endomorphism F. In this article we extend an observation of Lusztig (which gives a numerical relationship between an ordinary character of GF an ...
We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q ) from one of the hon ...
We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q ) from one of the hones ...
In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. By combining the polynomial time relat ...
The embedded model is used in finite elements to account for the influence of the reinforcement in concrete. This report describes the embedded model, its concept and equations. Details are also given as to the constitutive relations of concrete and steel. ...
Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...
We address the problem of data gathering in adhoc networks. We propose a novel framework where sensor signals are quantized and mapped to a finite field. The network nodes then combine the data from different sensors to form messages that are transmitted t ...