7106 search results - page 28 / 1422 » Restricted Complexity, General Complexity |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
We investigate the computational complexity of an optical model of computation called the continuous space machine (CSM). We characterise worst case resource growth over time for e...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
ENDM
2010
13 years 7 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
ISPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...