Under the auspices of the Computational Complexity Foundation (CCF)
We show that the complexity class LogFew is contained in NL $\cap$ SPL. Previously, this was known only to hold in the nonuniform setting.
