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

First Page		Document Content
Date: 2014-04-12 03:57:38 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 Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 85,71 KB Share Document on Facebook