Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...
Let A be a nonnegatively graded connected algebra over a noncommutative separable k-algebra K, and let M be a bounded below graded right A-module. If we denote by T the -coalgebra , we know that there exists an -comodule structure on over T. The structure ...
We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...
The aim of this article is to provide explicit formulas for the cup product on the Hochschild cohomology of any nonnegatively graded connected algebra and for the cap products on the Hochschild homology of with coefficients in any graded bimodule at the le ...
Our objective is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of a simplicial set embedded in induces a multiplicative filtration on the dg algebra of simplicial cochains, w ...
Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...
INTERNODES is a general method to deal with non-conforming discretizations of second order partial differential equations on regions partitioned into two or several subdomains. It exploits two intergrid interpolation operators, one for transfering the Diri ...
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 ...
EPFL2013
The multiquery solution of parametric partial differential equations (PDEs), that is, PDEs depending on a vector of parameters, is computationally challenging and appears in several engineering contexts, such as PDE-constrained optimization, uncertainty qu ...
EPFL2018
This article approaches the incremental view maintenance problem from an algebraic perspective. The algebraic structure of a ring of databases is constructed and extended to form a powerful aggregate query calculus. The query calculus inherits the key prop ...
