Login / Signup
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
Edith Hemaspaandra
Jörg Rothe
Holger Spakowski
Published in:
CoRR (2001)
Keyphrases
</>
access control
massively parallel
np hard
parallel processing
search algorithm
computational complexity
search strategies
parallel implementation
computer architecture
evolutionary algorithm
dynamic programming
heuristic search
shared memory