Publication

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward

Publications associées (33)

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

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

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward

Graph Chatbot

Chattez avec Graph Search

Geometric Considerations in Lattice Programming

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

Discrete Optimal Transport with Independent Marginals is #P-Hard

New Results in Integer and Lattice Programming

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Adaptive Streaming in Interactive Multiview Video Systems

String Matching: Communication, Circuits, and Learning

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

LPN in Cryptography

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

String Matching: Communication, Circuits, and Learning

Discrete Optimal Transport with Independent Marginals is #P-Hard

New Results in Integer and Lattice Programming

Adaptive Streaming in Interactive Multiview Video Systems

LPN in Cryptography

Geometric Considerations in Lattice Programming