Concept

Proof theory

Related publications (150)

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.

Polynomiality of Hurwitz numbers, Bouchard-Marino conjecture, and a new proof of the ELSV formula

Nicolas Gerson Orantin

In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formul ...

Academic Press Inc Elsevier Science2015

Superlensing using complementary media

Hoài-Minh Nguyên

This paper studies magnifying superlens using complementary media. Superlensing using complementary media was suggested by Veselago in [16] and innovated by Nicorovici et al. in [9] and Pendry in [10]. The study of this problem is difficult due to two fact ...

Gauthier-Villars/Editions Elsevier2015

Superspace formulation of the local RG equation

Boaz Keren Zur

We present the superspace formulation of the local RG equation, a framework for the study of supersymmetric RG flows in which the constraints of holomorphy and R-symmetry are manifest. We derive the consistency conditions associated with super-Weyl symmetr ...

Springer2015

Sparse Probabilistic Models

Andrei Giurgiu

This thesis is concerned with a number of novel uses of spatial coupling, applied to a class of probabilistic graphical models. These models include error correcting codes, random constraint satisfaction problems (CSPs) and statistical physics models calle ...

EPFL2015

Induction for SMT Solvers

Viktor Kuncak, Andrew Joseph Reynolds

Satisfiability modulo theory solvers are increasingly being used to solve quantified formulas over structures such as integers and term algebras. Quantifier instantiation combined with ground decision procedure alone is insufficient to prove many formulas ...

Springer-Verlag Berlin2015

Audio Steganography using Convex Demixing

Yann Mikaël Schoenenberger

In the first part, we first introduce steganography (in chapter 1) not in the usual context of information security, but as a method to piggyback data on top of some content. We then focus on audio steganography and propose a new steganographic scheme in c ...

2014

Measuring the Dynamics of Contrast & Daylight Variability in Architecture: A Proof of Concept Methodology

Marilyne Andersen, Siobhan Francois Rockcastle

Unlike artificial light sources, which can be calibrated to meet a desired luminous effect regardless of latitude, climate, or time of day, daylight is a dynamic light source, which produces variable shadow patterns and fluctuating levels of brightness. Wh ...

Elsevier2014

Percolation and Universal Scaling in Composite Infiltration Processing

Andreas Mortensen, Ludger Weber, Alain Léger

Composite materials are often made by infiltration, that is, by injecting a liquid matrix between packed solid fibers or particles. We give here direct proof that molten copper, slowly infiltrated into a broad spectrum of preforms, displays in initial phas ...

2014

Pyridomycin bridges the NADH- and substratebinding pockets of the enoyl reductase InhA

Stewart Cole, Florence Pojer, Ruben Hartkoorn, Joao Pedro De Almeida Neres

Pyridomycin, a natural product with potent antituberculosis activity, inhibits a major drug target, the InhA enoyl reductase. Here, we unveil the co-crystal structure and unique ability of pyridomycin to block both the NADH cofactor- and lipid substrate-bi ...

Nature Publishing Group2014

On Induction for SMT Solvers

Viktor Kuncak, Andrew Joseph Reynolds

2014