Computational complexity of two variants of the possible winner problem.
Dorothea BaumeisterMagnus RoosJörg RothePublished in: AAMAS (2011)
Keyphrases
- computational complexity
- np complete
- low complexity
- special case
- computational cost
- computationally efficient
- high computational complexity
- information systems
- related algorithms
- databases
- partial order
- np hard
- computational efficiency
- decision problems
- probability distribution
- memory requirements
- expert systems
- genetic algorithm