A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions

A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions Hans-Ulrich Simon 102-106 Information and Control October/November/December 1982 55 1-3 db/journals/iandc/iandc55.html#Simon82