69 search results - page 7 / 14 » Corecursive Algebras: A Study of General Structured Corecurs... |
144
click to vote
LICS
2010
IEEE
15 years 21 days ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
133
click to vote
ICFP
2006
ACM
16 years 2 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
140
click to vote
CSL
2005
Springer
15 years 8 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
114
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
109
click to vote
GD
2009
Springer
15 years 18 days ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...