An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and is consequently NP-hard. Thus, it is natural to study how restrictions on the allowed constraint types (or constraint languages) affe...

The collective dynamics of liquid gallium close to the melting point has been studied using inelastic x-ray scattering to probe length scales smaller than the size of the first coordination shell. Although the structural properties of this partially covalent liquid strongly deviate from a simple hard-sphere model, the dynamics, as reflected in the quasielastic scattering, are beautifully descri...

A long standing issue in theoretical computer science is to find a problem that is both hard to solve and hard to solve on many instances. In this work we prove that the Succinct Permanent mod p is NEXP time hard in the worst case (via randomized polynomial time reduction). We find hard instance for any given heuritsic, either by running the heuristic applying the techniques in [3] toNEXP , or ...

Finding a problem that is both hard to solve and hard to solve on many instances is a long standing issue in theoretical computer science. In this work, we prove that the Succinct Permanent mod p is NEXP time hard in the worst case (via randomized polynomial time reduction). We find hard instances for any given heuristic, either by running the heuristic, applying the techniques in [5] to NEXP ,...

The neighbor distribution in hard-sphere and hard-disk fluids is analyzed using Voronoi tessellation. The statistical measures analyzed are the nth neighbor coordination number (Cn), the nth neighbor distance distribution [fn(r)], and the distribution of the number of Voronoi faces (Pn). These statistics are sensitive indicators of microstructure, and they distinguish thermodynamic and annealed...

Do people who work hard also tend to play hard? We tested this hypothesis using an online questionnaire-based study of a large volunteer sample of university undergraduate students. Participants responded to questions designed to detect variation in attraction to accomplishment/fame (or ‘work’) and attraction to leisure (or ‘play’). Additional questions were asked, for use in posthoc explorator...