323 search results - page 57 / 65 » Dualizability and graph algebras |
101
click to vote
CSR
2008
Springer
14 years 11 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
113
click to vote
DM
2006
14 years 11 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
102
click to vote
CP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
CONCUR
2009
Springer
15 years 6 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
114
click to vote
DAC
1994
ACM
15 years 3 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...