Concept

Équation polynomiale

Publications associées (32)

Stable high-order randomized cubature formulae in arbitrary dimension

We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure μ defined on a domain Γ⊆ℝ^d, in any dimension d. Each cubature formula is conceived to be exact on a given finite dim ...

2018

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Formal Verification of Integer Multipliers by Combining Gröbner Basis with Logic Reduction

Mathias Soeken

Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynom ...

IEEE2016

Boolean logic optimization in majority-inverter graphs

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

We present a Boolean logic optimization framework based on Majority-Inverter Graph (MIG). An MIG is a directed acyclic graph consisting of three-input majority nodes and regular/complemented edges. Current MIG optimization is supported by a consistent alge ...

2016

Modeling and Optimal Control of a Redox Flow Battery

Hubert Girault, Dominique Bonvin, Timm Faulwasser, Julien Léo Billeter, Heron Vrubel, Véronique Amstutz, Alberto Battistel, Daniel Wrang

Vanadium Redox Flow Batteries (VRFB) can be used as energy storage device, for example to account for wind or solar power fluctuations. In VRFBs charge is stored in two tanks containing two different vanadium solutions. This approach decouples the storage ...

2016

Data Reconciliation in Open Reaction Systems using the Concept of Extents

Dominique Bonvin, Julien Léo Billeter, Sriniketh Srinivasan

Kinetic models of chemical reaction systems are typically represented in terms of state variables, such as concentrations, temperature and partial pressures [1]. These state variables in turn depend on the underlying reactions, transfer phenomena, and tran ...

2015

A Tale of Two Quasi-Polynomial Algorithms

Robert Granger

In 2013 the Discrete Logarithm Problem in finite fields of small characteristic enjoyed a rapid series of developments, starting with the heuristic polynomial-time relation generation method due to Gologlu, Granger, McGuire and Zumbragel, and culminating w ...

2015

Boolean Logic Optimization in Majority-Inverter Graphs

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

2015

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Analytic derivation of the (k/j)-order modulation envelopes in the sum of two mistuned (co)sine waves

Isaac Amidror

The beating effects which may occur in the sum of two mistuned cosine (or sine) functions whose frequencies f1, f2 satisfy f2 ≈ (k/j)f1 (where k/j is a reduced integer ratio) are known as “beats of mistuned consonances”. They have already been investigated ...

2015

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.

Connectez-vous pour utiliser Chat avec Graph Search