SIGN IN
SIGN UP
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Full Text:
PDF
Buy this Article
Author:
Martin Grohe
Humboldt-Universität zu Berlin, Berlin, Germany
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 54 Issue 1, March 2007
Article No. 1
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1206035.1206036
2007 Article
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 108
· Downloads (cumulative): 1,114
· Citation Count: 43
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
complexity
computations on discrete structures
conjunctive queries
constraint and logic languages
constraint satisfaction
homomorphisms
parameterized complexity
query languages
relations among complexity measures
theory
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