| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11021123 | Information and Computation | 2018 | 21 Pages |
Abstract
Technically, our results establish the effectiveness of two lower bound techniques for CP+âred: via strategy extraction and via monotone feasible interpolation.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla,