ERC Advanced Grant 2016
نویسندگان
چکیده
منابع مشابه
Status of (Direct and) Indirect Dark Matter searches
∗Speaker. †I acknowledge the financial support of the European Research Council (ERC) under the EU Seventh Framework Programme (FP7/2007-2013)/ERC Starting Grant (agreement n. 278234 — ‘NEWDARK’ project hosted by CNRS) and Advanced Grant (n. 267117 — ‘DARK’ project hosted by Université Pierre & Marie Curie Paris 6. I thank my collaborators and many of the participants / speakers in ICRC 2015 fo...
متن کاملParallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction
We use a recently discovered constrained de Finetti reduction (aka “PostSelection Lemma”) to study the parallel repetition of multi-player non-local games under no-signalling strategies. Since the technique allows us to reduce general strategies to independent plays, we obtain parallel repetition (corresponding to winning all rounds) in the same way as exponential concentration of the probabili...
متن کاملCell scientist to watch--Sascha Martens.
Sascha Martens obtained both his Diploma and PhD at the University of Cologne in Germany in the laboratory of Jonathan Howard. He pursued his postdoctoral training as an EMBO Long-Term Fellow in the group of Harvey McMahon at the Laboratory of Molecular Biology in Cambridge, UK, during which time he also received the AAAS/Science Program for Excellence in Science Award. In 2009 Sascha became a ...
متن کاملNullspace embeddings for outerplanar graphs
We study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph G = (V,E), we define a 1 The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement n 227701. 2...
متن کاملOn the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, MAXIMUM ACYCLIC SUBGRAPH and MAXIMUM BETWEENNESS, we prove NP-hard approximation factors of 14 15 + ε and 1 2 + ε . When it is hard to approximate an OCSP by a constant better than taking a uniformly-at-random ordering, then the OCSP is said to be approximation r...
متن کامل