Tractability and Learnability Arising from Algebras with Few Subpowers.
Pawel M. IdziakPetar MarkovicRalph McKenzieMatthew ValerioteRoss WillardPublished in: SIAM J. Comput. (2010)
Keyphrases
- finite automata
- maximal tractable
- topological spaces
- constraint satisfaction
- boolean functions
- np complete
- uniform distribution
- inductive inference
- computational complexity
- uniform convergence
- pattern languages
- learning algorithm
- dnf formulas
- spatial reasoning
- inductive logic programming
- membership queries
- vapnik chervonenkis dimension
- clifford algebra
- sample size
- neural network