Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Simulation theories have in recent years proposed that a cognitive agent's "inner world" can at least partly be constituted by internal emulations or simulations of ...
We develop and evaluate a two-level simulation procedure that produces a confidence interval for tail conditional expectation, otherwise known as conditional tail expectation. Th...