We present a PTAS for agnostically learning halfspaces w.r.t. the uniform distribution on the d dimensional sphere. Namely, we show that for every μ > 0 there is an algorithm that runs in time poly ( d, 1 ) , and is guaranteed to return a classifier with error at most (1 + μ)opt + , where opt is the error of the best halfspace classifier. This improves on Awasthi, Balcan and Long [2] who showed...

We study the complexity of approximating the value of the independent set polynomial ZG(λ) of a graph G with maximum degree ∆ when the activity λ is a complex number. When λ is real, the complexity picture is well-understood, and is captured by two real-valued thresholds λ∗ and λc, which depend on ∆ and satisfy 0 < λ ∗ < λc. It is known that if λ is a real number in the interval (−λ∗, λc) then ...

The adiabatic distorted wave approximation (ADWA) is widely used by the nuclear community to analyse deuteron stripping (d, p) experiments. It provides a quick way take into account an important property of reaction mechanism: breakup. In this work we provide numerical quantification perturbative correction theory, recently proposed in Johnson (2014 J. Phys. G: Nucl. Part. 41 094005) for separa...