Previous Conferences & Workshops

Feb
13
2006

Computer Science/Discrete Mathematics Seminar I

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity
Joel Friedman
11:15am|S-101

Counting connected components and Betti numbers was a known technique in algebraic complexity theory in the late 1970's and early 1980's. Speculation arose as to whether such methods could attack lower bounds in Boolean complexity theory (e.g., P vs...