Publications related to New Hardness Results for Diophantine Approximation

Results on Sparse Integer Programming and Geometric Independent Sets

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n.Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed p ...

EPFL2023

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Serge Vaudenay, Bénédikt Minh Dang Tran

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

Springer2023

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

Minimum Cost Intervention Design for Causal Effect Identification

Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

PMLR2022

Data-based model maintenance in the era of industry 4.0: A methodology

Antoine Pélissier

Despite the high number of investments for data-based models in the expansion of Industry 4.0, too little effort has been made to ensure the maintenance of those models. In a data-streaming environment, data-based models are subject to concept drifts. A co ...

ELSEVIER SCI LTD2022

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Oliver Kröcher, Frédéric Vogel, David Baudouin, Ayush Agarwal

Ru/CNF catalysts of different Ru nanoparticle (NP) sizes (0.9-2.7 nm) were assessed for their performance in continuous supercritical water gasification (SCWG) of glycerol. A structure sensitivity of Ru was demonstrated, with high initial turnover frequenc ...

2022

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

Jean-Yves Le Boudec, Mario Paolone, Lorenzo Enrique Reyes Chamorro, Cong Wang, Roman Rudnik, Jagdish Prasad Achara

An electric vehicle (EV) charging method which considers the EVs heterogeneity, taking into account the absence of any information about future arrivals and departures, and of the amount of time any charging will take. The method further considers both swi ...

2020

Sparsity Invariance for Convex Design of Distributed Controllers

Maryam Kamgarpour, Luca Furieri, Yu Zheng

We address the problem of designing optimal linear time-invariant (LTI) sparse controllers for LTI systems, which corresponds to minimizing a norm of the closed-loop system subjected to sparsity constraints on the controller structure. This problem is NP-h ...

2020

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Mika Tapani Göös

We study the search problem class PPA_q defined as a modulo-q analog of the well-known polynomial parity argument class PPA introduced by Papadimitriou (JCSS 1994). Our first result shows that this class can be characterized in terms of PPA_p for prime p. ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020

New Hardness Results for Diophantine Approximation

Graph Chatbot

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

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

Minimum Cost Intervention Design for Causal Effect Identification

Data-based model maintenance in the era of industry 4.0: A methodology

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

New Results in Integer and Lattice Programming

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

Sparsity Invariance for Convex Design of Distributed Controllers

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

New Results in Integer and Lattice Programming

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Sparsity Invariance for Convex Design of Distributed Controllers

Results on Sparse Integer Programming and Geometric Independent Sets

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

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

Minimum Cost Intervention Design for Causal Effect Identification

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

Data-based model maintenance in the era of industry 4.0: A methodology