Extractors and Lower Bounds for Locally Samplable Sources.
Anindya DeThomas WatsonPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- lower bound
- upper bound
- objective function
- multiple sources
- information sources
- data sources
- branch and bound algorithm
- branch and bound
- vc dimension
- upper and lower bounds
- np hard
- worst case
- linear programming relaxation
- max sat
- globally consistent
- database
- external information
- blind source separation
- sample complexity
- xml documents
- computational complexity
- search algorithm
- databases