## Webpage:

## Time:

## Venue:

- AG-80

## Organisers:

We investigate the following question: If NP contains functions which are slightly hard to compute on average then does NP also contain function which is very hard to compute on average? Similar result is shown to hold outside NP by Yao by his celebrated XOR lemma. But same technique breaks down to amplify the hardness inside NP.