2661 search results - page 115 / 533 » Quantum Complexity Classes |
124
click to vote
EOR
2008
15 years 3 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
146
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
115
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
112
click to vote
MOC
1998
15 years 2 months ago
1998
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
131
click to vote
FSS
2010
15 years 1 months ago
2010
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...