Publications related to Irreducible polynomial

On verifying causal consistency

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of verifying automaticall ...

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2016

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

Robert Granger

For any positive integers

n\geq 3, r\geq 1

we present formulae for the number of irreducible polynomials of degree

n

over the finite field

\mathbb{F}_{2^r}

where the coefficients of

x^{n-1}

,

x^{n-2}

and

x^{n-3}

are zero. Our proofs involve coun ...

Elsevier2016

Polynomials Vanishing On Cartesian Products: The Elekes-Szabo Theorem Revisited

Frank de Zeeuw

Let F 2 C[x; y; z] be a constant-degree polynomial, and let A; B; C subset of C be finite sets of size n. We show that F vanishes on at most O(n(11/6))points of the Cartesian product A X B X C, unless F has a special group-related form. This improves a the ...

Duke Univ Press2016

On Verifying Causal Consistency

Rachid Guerraoui, Jad Hamza

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of verifying automaticall ...

2016

Error estimates for finite element approximations of nonlinear monotone elliptic problems with application to numerical homogenization

Assyr Abdulle, Martin Ernst Huber

We consider a finite element method (FEM) with arbitrary polynomial degree for nonlinear monotone elliptic problems. Using a linear elliptic projection, we first give a new short proof of the optimal convergence rate of the FEM in the L2 norm. We then deri ...

Wiley-Blackwell2016

Isometries of quadratic spaces

Eva Bayer Fluckiger

Let k be a global field of characteristic not 2, and let f is an element of k[X] be an irreducible polynomial. We show that a non-degenerate quadratic space has an isometry with minimal polynomial f if and only if such an isometry exists over all the compl ...

European Mathematical Soc2015

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015

Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

Fabio Nobile, Giovanni Migliorati

We analyze the stability and accuracy of discrete least squares on multivariate polynomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated s ...

2015

MATHICSE Technical Report : Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

Fabio Nobile, Giovanni Migliorati

We analyze the stability and accuracy of discrete least squares on multivariate poly- nomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated ...

MATHICSE2015

Irreducible polynomial

Graph Chatbot

Chat with Graph Search

On verifying causal consistency

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

Polynomials Vanishing On Cartesian Products: The Elekes-Szabo Theorem Revisited

On Verifying Causal Consistency

Error estimates for finite element approximations of nonlinear monotone elliptic problems with application to numerical homogenization

Isometries of quadratic spaces

On the discrete logarithm problem in finite fields of fixed characteristic

Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

MATHICSE Technical Report : Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

Polynomials Vanishing On Cartesian Products: The Elekes-Szabo Theorem Revisited

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

On verifying causal consistency

On Verifying Causal Consistency

Isometries of quadratic spaces

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Error estimates for finite element approximations of nonlinear monotone elliptic problems with application to numerical homogenization

On the discrete logarithm problem in finite fields of fixed characteristic

MATHICSE Technical Report : Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets