Publications associées à The generic Gröbner walk

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.

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

An extremal problem on crossing vectors

Bartosz Maria Walczak, Michal Lason

For positive integers w and k, two vectors A and B from Z(w) are called k-crossing if there are two coordinates i and j such that A[i] - B[i] >= k and B[j] - A[j] >= k. What is the maximum size of a family of pairwise 1-crossing and pairwise non-k-crossing ...

Academic Press Inc Elsevier Science2014

Synthesis of Fixed-Point Programs

Viktor Kuncak, Eva Darulova, Indranil Saha

Several problems in the implementations of control systems, signal-processing systems, and scientific computing systems reduce to compiling a polynomial expression over the reals into an imperative program using fixed-point arithmetic. Fixed-point arithmet ...

2013

On the Generation of Precise Fixed-Point Expressions

Viktor Kuncak, Eva Darulova, Indranil Saha

2013

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Rüdiger Urbanke, Seyed Hamed Hassani

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the performance to ...

2012

ElimLin Algorithm Revisited

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

ElimLin is a simple algorithm for solving polynomial systems of multivariate equations over small finite fields. It was initially proposed as a single tool by Courtois to attack DES. It can reveal some hidden linear equations existing in the ideal generate ...

Springer2012

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Rüdiger Urbanke, Seyed Hamed Hassani

Ieee2012

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008

The generic Gröbner walk

Graph Chatbot

Chattez avec Graph Search

Computing in social networks

An extremal problem on crossing vectors

Synthesis of Fixed-Point Programs

On the Generation of Precise Fixed-Point Expressions

New Results in the Theory of Linear and Integer Programming

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

ElimLin Algorithm Revisited

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Le "Fragmentum de inventionibus scientiarum" de Diego Palomino

Parametric integer programming in fixed dimension

Synthesis of Fixed-Point Programs

On the Generation of Precise Fixed-Point Expressions

New Results in the Theory of Linear and Integer Programming

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Computing in social networks

An extremal problem on crossing vectors

ElimLin Algorithm Revisited

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Le "Fragmentum de inventionibus scientiarum" de Diego Palomino

Parametric integer programming in fixed dimension