Concept

Cyclotomic polynomial

Related publications (32)

On the Generation of Precise Fixed-Point Expressions

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

Synthesis of Fixed-Point Programs

Viktor Kuncak, Eva Darulova, Indranil Saha

2013

Multiple signal classification technique for phase estimation from a fringe pattern

Pramod Rastogi

The paper introduces a multiple signal classification technique based method for fringe analysis. In the proposed method, the phase of a fringe pattern is locally approximated as a polynomial. The polynomial phase signal is then transformed to obtain signa ...

Optical Society of America2012

Complexity of the critical node problem over trees

Marco Di Summa

In this paper we deal with the critical node problem (CNP), i.e., the problem of searching for a given number K of nodes in a graph G, whose removal minimizes the (weighted or unweighted) number of connections between pairs of nodes in the residual graph. ...

2011

Single-field inflation constraints from CMB and SDSS data

Julien Lesgourgues, Fabio Finelli, Jan Hamann

We present constraints on canonical single-field inflation derived from WMAP five year, ACBAR, QUAD, BICEP data combined with the halo power spectrum from SDSS LRG7. Models with a non-scale-invariant spectrum and a red tilt n(S) < 1 are now preferred over ...

2010

Minimum euclidien des ordres maximaux dans les algèbres centrales à division

Jérôme Chaubert

This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...

EPFL2007

Upper bounds for Euclidean minima of algebraic number fields

Eva Bayer Fluckiger

The aim of this paper is to give new upper bounds for Euclidean minima of algebraic number fields. In particular, to show that Minkowski's conjecture holds for the maximal totally real subfields of cyclotomic fields of prime power conductor. ...

2006

Réseaux idéaux sur des corps CM et des corps totalement réels

Ivan Suarez Atias

This thesis deals with the study of ideal lattices over number fields. Let K be a number field, which is assumed to be CM or totally real. An ideal lattice over K is a pair (I,b), where I is a fractional ideal of K and b : I × I → R is a symmetric positive ...

EPFL2005

A polynomial case of inconstrained zero-one queadratic optimization

Thomas Liebling, Kim Alexandre Allemand

Unconstrained zero-one quadratic maximization problems can be solved in polynomial time when the symmetric matrix describing the objective function is positive semidefinite of fixed rank with known spectral decomposition. ...

2001

Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields

Arjen Lenstra

The author shows how to use cyclotomic polynomials to construct subgroups of multiplicative groups of finite fields that allow very efficient implementation of discrete logarithm based public key cryptosystems. Depending on the type of application and impl ...

1997

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.