We consider the problem of classical strong (amplitude-wise) simulation of n-qubit quantum
circuits, and identify a subclass of simulators we call monotone. This subclass encompasses …

We study the time complexity of induced subgraph isomorphism problems where the pattern
graph is fixed. The earliest known example of an improvement over trivial algorithms is by …

Hierarchical key assignment scheme is an efficient cryptographic method for hierarchical
access control, in which the encryption keys of lower classes can be derived by the higher …

Learning machines for structured data (eg, trees) are intrinsically based on their capacity to
learn representations by aggregating information from the multi-way relationships emerging …

Abstract Information-theoretic private information retrieval (PIR) schemes have attractive
concrete efficiency features. However, in the standard PIR model, the computational …

We prove lower bounds on pure dynamic programming algorithms for maximum weight
independent set (MWIS). We model such algorithms as tropical circuits, ie, circuits that …

We analyze data to build a quantitative understanding of the world. Linear algebra is the
foundation to algorithms, dating back one hundred years, for extracting structure from data …

We define a notion of complexity, which quantifies the nonlinearity of the computation of a
neural network, as well as a complementary measure of the effective dimension of feature …

We study the problem of counting the isomorphic occurrences of a k-vertex pattern graph P
as a subgraph in an n-vertex host graph G. Our specific interest is on algorithms for …

The treewidth of a graph describes its tree-likeness by how well it can be decomposed by
small separators. It is defined as the minimum width of a tree decomposition of the graph …