Concept

Parameterized complexity

Related publications (630)

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.

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

ePrint2018

Geometric Model Order Reduction

Babak Maboudi Afkham

During the past decade, model order reduction (MOR) has been successfully applied to reduce the computational complexity of elliptic and parabolic systems of partial differential equations (PDEs). However, MOR of hyperbolic equations remains a challenge. S ...

EPFL2018

Super Resolution Phase Retrieval for Sparse Signals

Martin Vetterli, Juri Ranieri, Gilles Baechler, Amina Chebira, Miranda Krekovic

In a variety of fields, in particular those involving imaging and optics, we often measure signals whose phase is missing or has been irremediably distorted. Phase retrieval attempts to recover the phase information of a signal from the magnitude of its Fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

The complexity of error metrics

Mathias Soeken

Approximate computing exploits the fact that many applications do not require the results to be exact but not to exceed a threshold in a given error metric. Algorithms in approximate computing require to compute the error of the approximation in order to m ...

ELSEVIER SCIENCE BV2018

Explicit Conditions on Existence and Uniqueness of Load-Flow Solutions in Distribution Networks

Jean-Yves Le Boudec, Mario Paolone, Andrey Bernstein, Cong Wang

We present explicit sufficient conditions that guarantee the existence and uniqueness of the load-flow solution for distribution networks with a generic topology (radial or meshed) modeled with positive sequence equivalents. In the problem, we also account ...

2018

Comparison of L1 and L5 Bands GNSS Signals Acquisition

Cyril Botteron, Jérôme Leclère

Nowadays, civil Global Navigation Satellite System (GNSS) signals are available in both L1 and L5 bands. A receiver does not need to acquire independently the signals in both bands coming from a same satellite, since their carrier Doppler and code delay ar ...

2018

Ramsey-Turan numbers for semi-algebraic graphs

János Pach

A semi-algebraic graph G = (V, E) is a graph where the vertices are points in R-d, and the edge set E is defined by a semi-algebraic relation of constant complexity on V. In this note, we establish the following Ramsey-Turan theorem: for every integer p >= ...

ELECTRONIC JOURNAL OF COMBINATORICS2018

On some problems related to 2-level polytopes

Manuel Francesco Aprile

In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...

EPFL2018

RBF Based CWENO Method

Jan Sickmann Hesthaven, Fabian Mönkeberg

Solving hyperbolic conservation laws on general grids can be important to reduce the computational complexity and increase accuracy in many applications. However, the use of non-uniform grids can introduce challenges when using high-order methods. We propo ...

2018