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.
Summary form only given. Integer programming is the problem of maximizing a linear function over the integer vectors which satisfy a given set of inequalities. A wide range of combinatorial optimization problems can be modeled as integer programming proble ...
We consider the following integer feasibility problem: Given positive integer numbers a0, a1,&mellip;,an with gcd(a1,&mellip;,an) = 1 and a = (a1,&mellip;,an), does there exist a ...
Component composition and Web-service composition have in common that the usage pattern of a certain black-box component or Web-service needs to be described precisely. Because usually many interactions between the client and the service provider are requi ...
When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all correct processes to decide. In practice, what we might want ...
Since the discovery of the utility of the numbers, the human being tried to differentiate them. We decide between them according to whether they are even or odd. Or, according to the fact that they are prime or composite. A natural number n >1 is called a ...
Let K/Fq be an elliptic function field. For every natural number n we determine the number of prime divisors of degree n of K/Fq which lie in a given divisor class of K ...
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 ...
Computations of irregular primes and associated cyclotomic invariants were extended to all primes up to twelve million using multisectioning/convolution methods and a novel approach which originated in the study of Stickelberger codes (Shokrollahi (1996)). ...
