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.
We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...
The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An importa ...
Nowadays, the use of micro- or nano-patterned surfaces is well established in wide fields of science and in numerous applications in the industry. Periodic surface-relief profiles with dimensions in the wavelength range of the light can act as diffractive ...
Institut de Microtechnique, Université de Neuchâtel2007
The polynomial time algorithm of Lenstra, Lenstra, and Lovász [15] for factoring integer polynomials and variants thereof have been widely used to show that various computational problems in number theory have polynomial time solutions. Among them is the p ...
For an integer d a parts per thousand yen 1, let tau(d) be the smallest integer with the following property: if v (1), v (2), . . . , v (t) is a sequence of t a parts per thousand yen 2 vectors in [-1, 1] (d) with , then there is a set of indices, 2 a part ...
Springer2012
,
Shamir (1993) presented a family of cryptographic signature schemes based on birational permutations of the integers modulo a large integer N of unknown factorization. These schemes are attractive because of the low computational requirements, both ...
Gauss periods have been used successfully as a tool for constructing normal bases in finite fields. Starting from a primitive rth root of unity, one obtains under certain conditions a normal basis for mathbbFqn over Fq, where r is a prime and ...
This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...
Let S and S′ be compact Riemann surfaces of the same genus g (gge2) endowed with the Poincaré metric of constant negative curvature -1. par The authors show that for every epsilon>0, there exists an integer m=m(g,epsilon) with the property: Assum ...
We initiate the study of certain families of L-functions attached to characters of subgroups of higher-rank tori, and of their average at the central point. In particular, we evaluate the average of the values L( 2 1 , chi a )L( 21 , chi b ) for arbitrary ...
