Various types of discharges have been studied recently at ONERA using CARS. They are presented in this communication, following a brief review of the limiting mechanisms.

We provide new query complexity separations against sensitivity for total Boolean functions: a power 3 separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power 2.1 separation between certificate complexity and sensitivity. We get these separations by using a new connection between sensitivity and a seemingly unrelated measure called one-sid...

A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We construct a pseudorandom generator with seed-length 2O( √ s) · log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the best pseudorandom generators for this class of functions required...

We review several complexity measures for Boolean functions which are related to the study of the decision tree model. Among those measures, sensitivity is the simplest to define, but the most difficult to prove upper bounds in terms of it. We discuss the known upper bounds on other measures in terms of sensitivity and the proof techniques. By a simple decision tree construction, we suggest two...

Fueled in part by recent bestselling books that warn of the evils of gluten in our diets, a significant proportion of our population is now either avoiding foods that contain gluten or eliminating gluten entirely from their diets, and these numbers continue to grow. The gluten-free trend-and the accompanying multibillion-dollar industry it has created-stems from the spreading belief that eating...