We construct a succinct non-interactive publicly-verifiable delegation scheme for any logspace uniform circuit under the sub-exponential Learning With Errors (LWE) assumption.

Symmetry reduction is a well studied subject in geometric mechanics, where symmetries are usually described as an invariance under an action of a Lie group.

In this work, we design algorithms for two fundamentally important and classical graph problems in the planted setting.

As scientists and engineers, we have long aimed at solving real-time problems such as detecting and localizing objects seen by our video recorder or at least something like Pokemon's Animedex.