Sciweavers

94 search results - page 3 / 19
» Partitions and Clifford algebras
Sort
View
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 5 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan
LICS
2000
IEEE
13 years 9 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
CORR
2002
Springer
112views Education» more  CORR 2002»
13 years 5 months ago
Determination of the structure of algebraic curvature tensors by means of Young symmetrizers
For a positive definite fundamental tensor all known examples of Osserman algebraic curvature tensors have a typical structure. They can be produced from a metric tensor and a fini...
Bernd Fiedler
VISUALIZATION
2002
IEEE
13 years 10 months ago
Computing Singularities of 3D Vector Fields with Geometric Algebra
Critical points of a vector field are key to their characterization. Not only their positions but also their indexes are crucial for understanding vector fields. Considerable wo...
Stephen Mann, Alyn P. Rockwood
IJAC
2002
128views more  IJAC 2002»
13 years 5 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki