"Communication Complexity Lower Bounds by Polynomials"

Harry Buhrman, Ronald de Wolf (1999)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2020-01-10

a service of  Schloss Dagstuhl - Leibniz Center for Informatics