Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets.

Serge Gaspers Gregory B. Sorkin

Published in: ICALP (1) (2015)

Keyphrases

learning algorithm
computational complexity
lower bound
computational cost
optimization problems
computationally efficient
benchmark datasets
orders of magnitude
significant improvement
distance measure
max csp
worst case
theoretical analysis
evolutionary computation
times faster
highly efficient