There are no p-complete families of symmetric Boolean functions
We present a proof of a negative answer to the question raised by \textit{S. Skyum} and \textit{L. G. Valiant} [22nd Ann. IEEE Symp. on Foundations of Computer Science, New York, 244-253 (1981)], namely, whether the class of symmetric Boolean functions has a p-complete family.
scientific article; zbMATH DE number 4083548