Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic
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.
Cyclopentadienyl (Cp) metal complexes and their chiral counterparts (CpX) have enabled the development of challenging C-H activation transformations. While major progresses were made in developing new chiral CpX complexes and exploring their reactivity, th ...
Current machine learning models for vision are often highly specialized and limited to a single modality and task. In contrast, recent large language models exhibit a wide range of capabilities, hinting at a possibility for similarly versatile models in co ...
Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms.This ...
Let G be a simple algebraic group over an algebraically closed field F of characteristic p >= h, the Coxeter number of G. We observe an easy 'recursion formula' for computing the Jantzen sum formula of a Weyl module with p-regular highest weight. We also d ...
The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...
In several machine learning settings, the data of interest are well described by graphs. Examples include data pertaining to transportation networks or social networks. Further, biological data, such as proteins or molecules, lend themselves well to graph- ...
We propose a mathematical and numerical model for the simulation of the heart function that couples cardiac electrophysiology, active and passive mechanics and hemodynamics, and includes reduced models for cardiac valves and the circulatory system. Our mod ...
Starting from a strong Lattice-Free Maximum Mutual Information (LF-MMI) baseline system, we explore different autoencoder configurations to enhance Mel-Frequency Cepstral Coefficients (MFCC) features. Autoencoders are expected to generate new MFCC features ...
This paper proposes a representational model for image pairs such as consecutive video frames that are related by local pixel displacements, in the hope that the model may shed light on motion perception in primary visual cortex (V1). The model couples the ...
We derive a dynamical field theory for self-propelled particles subjected to generic torques and forces by explicitly coarse-graining their microscopic dynamics, described by a many-body Fokker-Planck equation. The model includes both intrinsic torques ind ...
