XCSP 2.1 Benchmarks
primes-15ExtConvert
Lecoutre's category
PATT (Patterned Instances) - Primes
Lecoutre's tooltips
The Primes instances are non-binary intensional instances which were created by Marc van Dongen. All instances are satisfiable. The domains of the variables consist of prime numbers and all constraints are linear equations. The coefficients and constants in the equations are also prime numbers. These instances are interesting because solving them using Gausian elimination is polynomial, assuming that the basic arithmetic operartions have a time complexity of O(1). In reality this assumption does not hold and the choise of prime numbers in the equations gives rise to large intermediate coefficients in the equations, making the basic operations more time consuming. It was hoped this would allow to compare the trade-off between using a GAC approach on the original equations and the Gausian elimination approach.
Source
http://www.cril.univ-artois.fr/~lecoutre/research/benchmarks/primes-15.tgz
Comments
None
Number of instances:
5 (1 processed, 0 partially processed, 4 failed)
Processing completed
primes-15-20-2-1-ext
Partially processed
Processing failed
primes-15-20-2-3
primes-15-20-2-3-ext
primes-15-20-2-5
primes-15-20-2-5-ext
