Publication at Faculty of Mathematics and Physics |
2005
Abstract
The paper describes a new cutoff method for depth-first search in the context of constraint satisfaction. This method is based on limiting the global number of assignments per variable.