Cover Image
Saved in:

Combinatorial search : from algorithms to systems /

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to...

Full description

Main Author: Hamadi, Youssef (Computer science researcher), (Author)
Corporate Author: SpringerLink (Online service)
Format: Online Book
Language:English
Published: Heidelberg : Springer, 2013.
Subjects:
Online Access:Online version
Tags: Add Tag
No Tags, Be the first to tag this record!