## For foundations of complexity theory, readers are referred to textbooks such as Knuth [1973] and Azmoodeh

- Mohr, Henderson
- For foundations of complexity theory, readers are…
- 1986

We explained in Chapter 2 that problem reduction is the process of removing values from domains, and tightening constraints in a CSP, without ruling out solution tuples from a CSP. The basic idea is that if we can deduce that a value or a compound label is redundant, then it can be removed, as doing so will not result in ruling out any solution tuples in a… CONTINUE READING

### Presentations referencing similar topics