# Counting of separable functions

1st October 2018 to 30th September 2021

The overall aim of this Royal Society University Research Fellowship is to tackle the following fundamental computational question: which problems modelled by separable functions are solvable efficiently? The goal is to characterise the inherent difficulty of problems and design efficient algorithms where they exist.