The Relative Complexity of Approximate Counting Problems.
Martin E. DyerLeslie Ann GoldbergCatherine S. GreenhillMark JerrumPublished in: Algorithmica (2004)
Keyphrases
- decision problems
- data sets
- computer vision
- application domains
- polynomial hierarchy
- real time
- np hardness
- approximate solutions
- problems involving
- hidden markov models
- website
- decision making
- databases
- multi objective
- evolutionary algorithm
- computational cost
- knowledge base
- space complexity
- practical problems
- search engine
- information retrieval