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:
RAIRO Theor. Informatics Appl. (2006)
Keyphrases
</>
access control
computational complexity
parallel implementation
search algorithm
parallel processing
search strategies
information access
neural network
branch and bound
shared memory
automatic recognition
parallel computation
parallel programming