141
Voted
RTA
15 years 4 months ago
1991 Springer 
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
127
click to vote
FOCS
15 years 4 months ago
1991 IEEE 
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
122
Voted
STACS
15 years 4 months ago
1991 Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
121
click to vote
FOCS
15 years 4 months ago
1991 IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
118
Voted
MFCS
15 years 4 months ago
1991 Springer 
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
|
Theoretical Computer Science