Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines.
Kunal MittalRan RazPublished in: ITCS (2021)
Keyphrases
- lower bound
- turing machine
- upper bound
- objective function
- parallel implementation
- computer games
- shared memory
- worst case
- point correspondences
- branch and bound
- parallel processing
- branch and bound algorithm
- educational games
- optimal solution
- serious games
- np hard
- sample complexity
- parallel computing
- vc dimension
- upper and lower bounds
- linear systems
- distributed memory
- data structure
- low degree