Skip to content

Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness.

Andr Gronemeier

VenueASTACS
Year2009
ProceedingsSTACS

Browse the full STACS paper archive.