Publications associées à Polynôme formel

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.

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Polynôme formel

Graph Chatbot

Chattez avec Graph Search

The cotangent complex and Thom spectra

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Admissibility of Uncertain Injections in Quadratic Algebraic Systems

Bayesian Decision Making in Groups is Hard

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

Single and multiple recurrence along non-polynomial sequences

On compact representations of Voronoi cells of lattices

Markov cubature rules for polynomial processes

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

New Results in Integer and Lattice Programming

The cotangent complex and Thom spectra

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

On compact representations of Voronoi cells of lattices

Admissibility of Uncertain Injections in Quadratic Algebraic Systems

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

New Results in Integer and Lattice Programming

Bayesian Decision Making in Groups is Hard

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Markov cubature rules for polynomial processes

Single and multiple recurrence along non-polynomial sequences