Algorithmics for Hard Problems

E2000672 UNEXPLORED

Algorithmics for Hard Problems is a comprehensive textbook that introduces techniques and concepts for designing and analyzing algorithms to tackle computationally difficult (often NP-hard) problems.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Algorithmics for Hard Problems canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Juraj Hromkovič → notableWork → Algorithmics for Hard Problems ⓘ