Publications associées à Polynôme

Quadrature-free immersed isogeometric analysis

Pablo Antolin Sanchez, Thibaut Hirschler

This paper presents a novel method for solving partial differential equations on three-dimensional CAD geometries by means of immersed isogeometric discretizations that do not require quadrature schemes. It relies on a newly developed technique for the eva ...

SPRINGER2022

On Polynomial Algorithms for Normalizing Formulas

Viktor Kuncak, Simon Guilloud, Mario Bucev

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2022

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Optimal denoising of rotationally invariant rectangular matrices

Florent Gérard Krzakala, Lenka Zdeborová, Emanuele Troiani, Vittorio Erba

In this manuscript we consider denoising of large rectangular matrices: given a noisy observation of a signal matrix, what is the best way of recovering the signal matrix itself? For Gaussian noise and rotationally-invariant signal priors, we completely ch ...

2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

Florent Gérard Krzakala, Lenka Zdeborová, Luca Pesce, Bruno Loureiro

A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...

2022

On the Kawamata-Viehweg vanishing theorem for log del Pezzo surfaces in positive characteristic

Emelie Kerstin Arvidsson, Fabio Bernasconi

We prove the Kawamata-Viehweg vanishing theorem for surfaces of del Pezzo type over perfect fields of positive characteristic p > 5. As a consequence, we show that klt threefold singularities over a perfect base field of characteristic p > 5 are rational. ...

CAMBRIDGE UNIV PRESS2022

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

An analytical solution of the isentropic vortex problem in the special relativistic magnetohydrodynamics

Junming Duan

The isentropic vortex problem is frequently solved to test the accuracy of numerical methods and verify corresponding code. Unfortunately, its existing solution was derived in the relativistic magnetohydrodynamics by numerically solving an ordinary differe ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

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.

Polynôme

Generic direct summands of tensor products for simple algebraic groups and quantum groups at roots of unity

Quadrature-free immersed isogeometric analysis

On Polynomial Algorithms for Normalizing Formulas

A PCP Theorem for Interactive Proofs and Applications

Optimal denoising of rotationally invariant rectangular matrices

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

On the Kawamata-Viehweg vanishing theorem for log del Pezzo surfaces in positive characteristic

The double exponential runtime is tight for 2-stage stochastic ILPs

An analytical solution of the isentropic vortex problem in the special relativistic magnetohydrodynamics

Graph Chatbot

Chattez avec Graph Search

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Quadrature-free immersed isogeometric analysis

Generic direct summands of tensor products for simple algebraic groups and quantum groups at roots of unity

Optimal denoising of rotationally invariant rectangular matrices

On Polynomial Algorithms for Normalizing Formulas

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

On the Kawamata-Viehweg vanishing theorem for log del Pezzo surfaces in positive characteristic

The double exponential runtime is tight for 2-stage stochastic ILPs

A PCP Theorem for Interactive Proofs and Applications

An analytical solution of the isentropic vortex problem in the special relativistic magnetohydrodynamics