6568 search results - page 331 / 1314 » Reducing the Complexity of Reductions |
165
click to vote
IANDC
1998
15 years 6 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
190
click to vote
CAI
2009
Springer
16 years 1 months ago
2009
Springer
Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two type...
192
click to vote
IWCMC
2009
ACM
16 years 1 months ago
2009
ACM
In wireless communication systems, adaptive modulation and coding (AMC) is used to improve the downlink (DL) spectral efficiency by exploiting the underlying channel condition. Ho...
168
click to vote
CADE
1999
Springer
15 years 11 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
168
click to vote
DL
1998
Springer
15 years 11 months ago
1998
Springer
When a digital library is decomposed into many geographically distributed repositories,searchefficiencybecomesan issue. Increasing network congestion makes this a compelling issue...