On the relative complexity of approximate counting problems.
Martin E. DyerLeslie Ann GoldbergCatherine S. GreenhillMark JerrumPublished in: APPROX (2000)
Keyphrases
- decision problems
- problems involving
- solving problems
- neural network
- information retrieval
- learning algorithm
- np complete
- probabilistic model
- polynomial hierarchy
- computational issues
- approximate solutions
- application domains
- optimization problems
- real time
- artificial neural networks
- expert systems
- social networks
- artificial intelligence
- real world
- databases