Skip to main content

TFNP: an Update

Paul Goldberg ( University of Oxford )

We introduce various NP total search problems (e.g. Factoring, Nash equilibrium, necklace-splitting, and others) and a new line of research that aims to give them a unifying theme.

 

 

Share this: