Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Factorization of polynomials over finite fields

Related publications (20)

The multivariate Serre conjecture ring

Luc Guyot

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Academic Press Inc Elsevier Science2023

Linear Complexity Self-Attention With 3rd Order Polynomials

Grigorios Chrysos

Self-attention mechanisms and non-local blocks have become crucial building blocks for state-of-the-art neural architectures thanks to their unparalleled ability in capturing long-range dependencies in the input. However their cost is quadratic with the nu ...

Ieee Computer Soc2023

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

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

ON WAVEFRONT ABERRATIONS IN ASYMMETRIC AND MULTIPLE APERTURE OPTICAL SYSTEMS

Alessandro Grosso

The present work deals with monochromatic wavefront aberrations in optical systems without symmetries. The treatment begins with a class of systems characterized by misaligned spherical surfaces whose behavior is analyzed using the wavefront aberration exp ...

EPFL2021

Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e(x)

Felix Schürmann, Fabien Jonathan Delalondre, Francesco Cremonesi, Timothée Ewart

The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented. In this article, we evaluate existing methods for polynomial evaluation on superscalar architecture. ...

2020

Coupling non-conforming discretizations of PDEs by spectral approximation of the Lagrange multiplier space

Simone Deparis, Luca Pegolotti

This work focuses on the development of a non-conforming method for the coupling of PDEs based on weakly imposed transmission conditions: the continuity of the global solution is enforced by a finite number of Lagrange multipliers defined over the interfac ...

2019

A Hybrid High-Order Method for Highly Oscillatory Elliptic Problems

Simon Clément Damien Lemaire

We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh; those attached to ...

WALTER DE GRUYTER GMBH2019

Distinct distances on regular varieties over finite fields

Van Thang Pham

In this paper we study some generalized versions of a recent result due to Covert, Koh, and Pi (2015). More precisely, we prove that if a subset in a regular variety satisfies vertical bar epsilon vertical bar >> q(d-1/2 + 1/k-1), then Delta(k,F)(epsilon) ...

Elsevier2017

The Interface Control Domain Decomposition Method For Stokes-Darcy Coupling

Alfio Quarteroni, Marco Discacciati

The interface control domain decomposition (ICDD) method of Discacciati, Gervasio, and Quarteroni [SIAM J. Control Optim., 51 (2013), pp. 3434-3458, doi:10.1137/120890764; J. Coupled Syst. Multiscale Dyn., 1 (2013), pp. 372-392, doi:10.1166/jcsmd.2013.1026 ...

Siam Publications2016

INTERNODES: an accurate interpolation-based method for coupling the Galerkin solutions of PDEs on subdomains featuring non-conforming interfaces

Alfio Quarteroni, Simone Deparis, Davide Forti

We are interested in the approximation of partial differential equations on domains decomposed into two (or several) subdomains featuring non-conforming interfaces. The non-conformity may be due to different meshes and/or different polynomial degrees used ...

Elsevier2016

Isogeometric numerical dispersion analysis for two-dimensional elastic wave propagation

Alfio Quarteroni, Luca Dede', Christoph Jäggli

In this paper, we carry out a numerical dispersion analysis for the linear two-dimensional elastodynamics equations approximated by means of NURBS-based Isogeometric Analysis in the framework of the Galerkin method; specifically, we consider the analysis o ...

Elsevier2015

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...

2014

Algebraic algorithms for network information flow

Javad Ebrahimi Boroojeni

Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...

EPFL2013

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

Computational performance of a parallelized three-dimensional high-order spectral element toolbox

Michel Deville, Roland Bouffanais, Christoph Bosshard

In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a particular emphasis on the parallel ef ...

2011

Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox

Michel Deville, Nicolas Fietier, Roland Bouffanais, Vincent Keller, Christoph Bosshard

In this paper, a comprehensive performance review of all MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of aspects with a particular emphasis on the parallel efficienc ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Finite-element preconditioning of G-NI spectral methods

Alfio Quarteroni

Several old and new finite-element preconditioners for nodal-based spectral discretizations of −laplace(u) = f in the domain

\Omega = (-1, 1)^d

(d = 2 or 3), with Dirichlet or Neumann boundary conditions, are considered and compared in terms of bothcondi ...

2009

BOOSTERS: a derivative-free algorithm based on radial basis functions

Michel Bierlaire, Rodrigue Oeuvray

Derivative-free optimization involves the methods used to minimize an expensive objective functionwhen its derivatives are not available. We present here a trust-region algorithmbased on Radial Basis Functions (RBFs). The main originality of our approach i ...

2009

A new derivative-free algorithm for the medical image registration problem

Michel Bierlaire, Rodrigue Oeuvray

The medical image registration problem can be formulated as a nonlinear programming problem. To identify appropriate algorithms to solve it, it is critical to analyze the properties of the problem. In this paper, we consider the image registration problem ...

2007