13603 search results - page 184 / 2721 » On the Computational Complexity of Cut-Reduction |
167
click to vote
IS
2008
15 years 6 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
178
click to vote
JSAC
2008
15 years 6 months ago
2008
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...
190
click to vote
TCOM
2008
15 years 6 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
203
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
184
click to vote
CPC
1998
15 years 6 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...