1209 search results - page 138 / 242 » Universal Algebra and Computer Science |
113
click to vote
MFCS
1997
Springer
15 years 7 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
132
click to vote
RANDOM
1997
Springer
15 years 7 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
103
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
134
Voted
AMAI
2007
Springer
15 years 3 months ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
125
click to vote
CAD
2010
Springer
15 years 3 months ago
2010
Springer
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...