13603 search results - page 89 / 2721 » On the Computational Complexity of Cut-Reduction |
171
click to vote
DEXAW
2004
IEEE
15 years 9 months ago
2004
IEEE
Complex systems are those systems composed of many, often very simple, interacting autonomous entities. Interactions between these entities give rise to behaviour and patterns at t...
174
click to vote
STACS
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
184
click to vote
TSP
2008
15 years 5 months ago
2008
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
158
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...
159
click to vote
TCOM
2010
15 years 4 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...