The computational complexity of the parallel knock-out problem.
Hajo BroersmaMatthew JohnsonDaniël PaulusmaIain A. StewartPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- computational complexity
- parallel processing
- np complete
- high computational complexity
- parallel implementation
- neural network
- data mining
- special case
- low complexity
- parallel hardware
- depth first search
- decision problems
- multiscale
- computational efficiency
- np hard
- message passing
- image processing
- knowledge base
- parallel architectures
- real time