Sciweavers

108
Voted
CP
2010
Springer
15 years 9 days ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard