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.
Similarly to the recently obtained result for two-terminal systems, we show that there are constraints on the full counting statistics for noninteracting fermions in multiterminal contacts. In contrast to the two-terminal result, however, there is no facto ...
We provide dramatic evidence that 'Mellin space' is the natural home for correlation functions in CFTs with weakly coupled bulk duals. In Mellin space, CFT correlators have poles corresponding to an OPE decomposition into 'left' and 'right' sub-correlators ...
Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization. ...
This paper describes carry-less arithmetic operations modulo an integer 2^M-1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implementa ...
D.J. Bernstein has proposed a circuit-based implementation of the matrix step of the number field sieve factorization algorithm (see "Circuits for integer factorization: a proposal", http://cr.yp.to/papers.html#nfscircuit, 2001). These circuits offer an as ...
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms based on inexact block-LU factorization of the linear system obtained after th ...
We investigate a general approach for the numerical approximation of incompressible Navier-Stokes equations based on splitting the original problem into successive subproblems which are cheaper to solve. The splitting is obtained through an algebraic appro ...
This paper describes carry-less arithmetic operations modulo an integer 2^M − 1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implemen ...
We establish new results and introduce new methods in the theory of measurable orbit equivalence. Our rigidity statements hold for a wide (uncountable) class of negatively curved groups. Amongst our applications are (a) measurable Mostow-type rigidity theo ...
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 21039 -1. Although this factorization is orders of magnitude ...
