Back to Results
First PageMeta Content
Combinatorica / Communication complexity / Academia / Computer science


Lower bounds in models other than communication complexity: Turing machines, branching programs, span programs, decision trees, Boolean circuits, property testing April 12, 2014
Add to Reading List

Document Date: 2014-04-12 03:57:38


Open Document

File Size: 85,71 KB

Share Result on Facebook
UPDATE