Tractability and learnability arising from algebras with few subpowers.
Pawel M. IdziakPetar MarkovicRalph McKenzieMatthew ValerioteRoss WillardPublished in: LICS (2007)
Keyphrases
- maximal tractable
- constraint satisfaction
- boolean functions
- pattern languages
- learning algorithm
- np complete
- finite automata
- uniform distribution
- spatial reasoning
- membership queries
- computational complexity
- inductive inference
- data sets
- dnf formulas
- uniform convergence
- pac learnability
- linear separability
- distributive lattices
- temporal reasoning
- inductive logic programming
- background knowledge
- vapnik chervonenkis dimension
- topological spaces