Publication

Superlensing using complementary media

Related publications (51)

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.

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus

Simon Guilloud

Motivated by the transfer of proofs between proof systems, and in particular from first order automated theorem provers (ATPs) to interactive theorem provers (ITPs), we specify an extension of the TPTP derivation text format to describe proofs in first-ord ...

2024

Orthologic with Axioms

Viktor Kuncak, Simon Guilloud

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having po ...

2024

, ,

We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic predicate and fun ...

2023

This data set provides a computer-assisted proof for the kernel inequalities needed to prove universal optimality in the paper "Universal optimality of the E_8 and Leech lattices and interpolation formulas" (by Cohn, Kumar, Miller, Radchenko, and Viazovska ...

EPFL Infoscience2023

A Gapless Post-quantum Hash Proof System in the Hamming Metric

Serge Vaudenay, Bénédikt Minh Dang Tran

A hash proof system (HPS) is a form of implicit proof of membership to a language. Out of the very few existing post-quantum HPS, most are based on languages of ciphertexts of code-based or lattice-based cryptosystems and inherently suffer from a gap cause ...

2023

This contribution outlines a research proposal combining ethical guidelines on AI and a law-as-data approach. Building upon the definitions of soft law discussed in legal scholarship, it proposes a way of structuring the regulatory landscape on AI and of a ...

UBIQUITY PRESS LTD2022

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

Maryam Kamgarpour, Baiwei Guo, Orcun Karaca

We provide a counterexample to the performance guarantee obtained in the paper "Il'ev, V., Linker, N., 2006. Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid", which was published in Volume 171 of the Eur ...

ELSEVIER2021

The controllability cost for the heat equation as the control time

T

goes to 0 is well-known of the order

e^{C/T}

for some positive constant

C

, depending on the controlled domain and for all initial datum. In this paper, we prove that the constant $C ...

2021

On the Power and Limitations of Branch and Cut

Mika Tapani Göös

The Stabbing Planes proof system [Paul Beame et al., 2018] was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formu ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

Switchover phenomenon induced by epidemic seeding on geometric networks

Gergely Odor

It is a fundamental question in disease modeling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. One important goal has been to find the seed configuration, which infects the most individuals. Although the id ...

2021

The controllability cost for the heat equation as the control time

T

goes to 0 is well-known of the order

e^{C/T}

for some positive constant

C

, depending on the controlled domain and for all initial datum. In this paper, we prove that the constant $C ...

2021