Generalized juntas and NP-hard sets.
Gábor ErdélyiLane A. HemaspaandraJörg RotheHolger SpakowskiPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- np hard
- learning theory
- scheduling problem
- special case
- lower bound
- set theoretic
- np complete
- computational complexity
- data structure
- linear programming
- information retrieval
- probabilistic model
- database systems
- worst case
- feature selection
- constraint satisfaction problems
- approximation algorithms
- np hardness
- set valued
- data sets