Lattices, mobius functions and communications complexity

Authors:
L. Lovasz;M. Saks
Affiliations:
Dept. of Comput. Sci., Eotvos Lorand Univ., Budapest, Hungary;-
Venue:
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Year:
1988

Citing 0
Cited 7

Original Contribution: Classes of feedforward neural networks and their circuit complexity

Neural Networks
On the parity complexity measures of Boolean functions

Theoretical Computer Science
Composition theorems in communication complexity

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On quantum-classical equivalence for composed communication problems

Quantum Information & Computation
Communication complexities of symmetric XOR functions

Quantum Information & Computation
On the nonnegative rank of distance matrices

Information Processing Letters
The Pattern Matrix Method

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...