SIGN IN
SIGN UP
A rendezvous of logic, complexity, and algebra
Full Text:
PDF
Buy this Article
Author:
Hubie Chen
Universitat Pompeu Fabra, Barcelona, Spain
Published in:
· Journal
ACM Computing Surveys (CSUR)
Surveys Homepage
archive
Volume 42 Issue 1, December 2009
Article No. 2
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1592451.1592453
2009 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 168
· Downloads (cumulative): 1,433
· Citation Count: 2
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 measures and classes
constraint satisfaction
mathematical logic
polymorphisms
propositional logic
quantified formulas
schaefer's theorem
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