admin
	project reminders
today
	communication complexity
ex:
	checksums for downloads
	appointment scheduling
defn:
	response functions
	protocol tree
		leaves labelled by outputs
lem: trivial ub of n+1
defn: combinatorial rectangle
prop: inputs reaching a node are a combinatorial rectangle
cor: c bits communication => partition into 2^c monochromatic rectangles
defn: P^cc
def: fooling set
lem: lb via fooling set
lem: lb for EQ
def: non-deterministic communication
	- short proof + CC
	- short proof + acceptance
	- cover number
defn: NP^cc, coNP^cc
lem: ub for \neg EQ
lem: lb via fooling set
cor: lb for EQ
fact: P^cc=NP^cc\cap coNP^cc
fact: R(EQ)\le O(\lg n)
def: randomized CC
def:
	1-tape TM
	2-tape TM
fact: 2-tape t(n) => 1-tape O(t^2)
prop: x0^ny on 1-tape TM in time t(n) => N_1(f) is t(n)/n+lg n
Cor: x0^nx requires n^2 time on 1-tape TM