Tutte polynomials computable in polynomial time.
James G. OxleyDominic J. A. WelshPublished in: Discret. Math. (1992)
Keyphrases
- turing machine
- finite sets
- special case
- computational complexity
- approximation algorithms
- worst case
- finite automata
- databases
- information systems
- algebraic geometry
- np hardness
- hermite transform
- lagrange interpolation
- polynomial size
- dnf formulas
- bounded treewidth
- feature vectors
- relational databases
- genetic algorithm