SIGN IN
SIGN UP
Closure properties of constraints
Full Text:
PDF
Buy this Article
Authors:
Peter Jeavons
Univ. of London, London, UK
David Cohen
Univ. of London, London, UK
Marc Gyssens
Univ. of Limburg, Diepenbeek, Belgium
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 44 Issue 4, July 1997
Pages 527-548
ACM
New York, NY
, USA
table of contents
doi>
10.1145/263867.263489
1997 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 45
· Downloads (cumulative): 660
· Citation Count: 132
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
complexity
complexity of proof procedures
constraint satisfaction problem
indicator problem
languages
np-completeness
reducibility and completeness
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder