Title
There are no p-complete families of symmetric Boolean functions
Abstract
We present a proof of a negative answer to the question raised by Skyum and Valiant (1981), namely, whether the class of symmetric Boolean functions has a p-complete family.
Year
DOI
Venue
1989
10.1016/0020-0190(89)90174-9
Inf. Process. Lett.
Keywords
Field
DocType
p-complete family,symmetric boolean function,boolean function
Boolean function,Discrete mathematics,Stone's representation theorem for Boolean algebras,Symmetric function,Combinatorics,Ring of symmetric functions,Stanley symmetric function,Parity function,Boolean expression,Mathematics,Complete Boolean algebra
Journal
Volume
Issue
ISSN
30
1
0020-0190
Citations 
PageRank 
References 
0
0.34
1
Authors
3
Name
Order
Citations
PageRank
Mihály Geréb-Graus18410.49
Ramamohan Paturi2126092.20
Endre Szemerédi32102363.27