A PCP Theorem for Interactive Proofs and Applications
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.
A set R⊂N is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every \unicode[STIX]x1D716>0 there exists a set B=⋃i=1raiN+bi, where $a_{1},\ldots ,a_ ...
Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...
We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...
It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...
We consider the problem of sampling at unknown locations. We prove that, in this setting, if we take arbitrarily many samples of a polynomial or real bandlimited signal, it is possible to find another function in the same class, arbitrarily far away from t ...
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 ...
In this paper we study some generalized versions of a recent result due to Covert, Koh, and Pi (2015). More precisely, we prove that if a subset in a regular variety satisfies vertical bar epsilon vertical bar >> q(d-1/2 + 1/k-1), then Delta(k,F)(epsilon) ...
Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynom ...
It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...
In this paper, we show that the sum rules for generalized Hermite polynomials derived by Daboul and Mizrahi (2005 J. Phys. A: Math. Gen. 38 427-48) and by Graczyk and Nowak (2004 C. R. Acad. Sci., Ser. 1 338 849) can be interpreted and easily recovered usi ...
