Theory of linear and integer programming
Theory of linear and integer programming
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A novel approach for dynamic authorisation planning in constrained workflow systems
Proceedings of the 6th International Conference on Security of Information and Networks
| Hi-index | 0.00 |
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If the CSP has n variables whose domain size is m, and if the equivalent programming problem involves M equations, then the number of solutions can be determined in time O(nm2M-n). This surprising link between search problems and algebraic techniques allows us to show improved bounds for several constraint satisfaction problems, including new simply exponential bounds for determining the number of solutions to the n-queens problem. We also address the problem of minimizing M for a particular CSP.