The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation).
Leslie Ann GoldbergMark JerrumPublished in: ICALP (1) (2012)
Keyphrases
- lagrange interpolation
- computational complexity
- approximation error
- worst case
- fixed parameter tractable
- error bounds
- polynomial hierarchy
- increase in computational complexity
- np hardness
- agnostic learning
- efficient computation
- space complexity
- np complete
- error tolerance
- information theoretic
- computational cost
- vapnik chervonenkis dimension
- approximation algorithms
- relative error
- genetic algorithm
- closed form
- np hard
- multiscale
- social networks
- learning algorithm