Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
39
click to vote
DAGSTUHL
2008
favorite
Email
discuss
report
107
views
Software Engineering
»
more
DAGSTUHL 2008
»
Recent Results on the Algebraic Approach to the CSP
14 years 27 days ago
Download
www.math.mcmaster.ca
Abstract. We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic framework.
Andrei A. Bulatov, Matthew Valeriote
Real-time Traffic
Algebraic Approach
|
Algebraic Framework
|
Constraint Satisfaction Problem
|
DAGSTUHL 2008
|
Software Engineering
|
claim paper
Post Info
More Details (n/a)
Added
29 Oct 2010
Updated
29 Oct 2010
Type
Conference
Year
2008
Where
DAGSTUHL
Authors
Andrei A. Bulatov, Matthew Valeriote
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision