Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Razborov:1992:DCD, author = "A. A. Razborov", title = "On the distributional complexity of disjointness", journal = j-THEOR-COMP-SCI, volume = "106", number = "2", pages = "385--390", day = "14", month = dec, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:51 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=106&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=106&issue=2&aid=1223", acknowledgement = ack-nhfb, classification = "C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Steklov Math. Inst., Moscow, Russia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "communication complexity; disjointness; distributional complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }