-
2
-
-
0004281677
-
-
Wiley Interscience, New York
-
E. ARTIN, Geometric Algebra, Wiley Interscience, New York, 1988.
-
(1988)
Geometric Algebra
-
-
Artin, E.1
-
4
-
-
4043081471
-
Computational approach to polynomial identities of matrices - A survey
-
A. Giambruno, A. Regev and M. Zaicev, eds., Lecture Notes in Pure and Applied Mathematics Dekker
-
F. BENANTI, J. DEMMEL, V. DRENSKY and P. KOEV, "Computational approach to polynomial identities of matrices - a survey," in Ring Theory: Polynomial Identities and Combinatorial Methods, A. Giambruno, A. Regev and M. Zaicev, eds., Lecture Notes in Pure and Applied Mathematics Vol. 235, Dekker, 2003, pp. 141-178.
-
(2003)
Ring Theory: Polynomial Identities and Combinatorial Methods
, vol.235
, pp. 141-178
-
-
Benanti, F.1
Demmel, J.2
Drensky, V.3
Koev, P.4
-
5
-
-
0142091458
-
Clifford algebras and approximating the permanent
-
Special issue on 34th ACM STOC, 2002, J. Reif, ed.
-
S. CHIEN, L. RASMUSSEN and A. SINCLAIR, "Clifford algebras and approximating the permanent," Journal of Computer and System Sciences 67 (2003), pp. 263-290. (Special issue on 34th ACM STOC, 2002, J. Reif, ed.)
-
(2003)
Journal of Computer and System Sciences
, vol.67
, pp. 263-290
-
-
Chien, S.1
Rasmussen, L.2
Sinclair, A.3
-
6
-
-
0001680370
-
A minimal basis for the identities for a second-order matrix algebra over a field of characteristic 0
-
V. DRENSKY, "A minimal basis for the identities for a second-order matrix algebra over a field of characteristic 0," Algebra and Logic 20 (1981), pp. 188-194.
-
(1981)
Algebra and Logic
, vol.20
, pp. 188-194
-
-
Drensky, V.1
-
8
-
-
17744397784
-
-
personal communication
-
V. DRENSKY, personal communication.
-
-
-
Drensky, V.1
-
11
-
-
0033699197
-
Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields
-
D. GRIGORIEV and A. RAZBOROV, "Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields," Applicable Algebra in Engineering, Communication and Computing 10 (2000), pp. 465-487.
-
(2000)
Applicable Algebra in Engineering, Communication and Computing
, vol.10
, pp. 465-487
-
-
Grigoriev, D.1
Razborov, A.2
-
12
-
-
4544234244
-
The formula size of the determinant
-
K. KALORKOTI, "The formula size of the determinant," SIAM Journal on Computing 14 (1995), pp. 678-687.
-
(1995)
SIAM Journal on Computing
, vol.14
, pp. 678-687
-
-
Kalorkoti, K.1
-
14
-
-
0003610144
-
-
Benjamin/Addison-Wesley, Reading MA, Reprinted with revisions
-
T.Y. LAM, The Algebraic Theory of Quadratic Forms, Benjamin/Addison- Wesley, Reading MA, 1973. (Reprinted with revisions, 1980.)
-
(1973)
The Algebraic Theory of Quadratic Forms
-
-
Lam, T.Y.1
-
15
-
-
22044440211
-
A theorem of Burnside on matrix rings
-
T.Y. LAM, "A theorem of Burnside on matrix rings," American Mathematical Monthly 105 (1998), pp. 651-653.
-
(1998)
American Mathematical Monthly
, vol.105
, pp. 651-653
-
-
Lam, T.Y.1
-
19
-
-
0039648502
-
Lower bounds on arithmetic circuits via partial derivatives
-
N. NISAN and A. WIGDERSON "Lower bounds on arithmetic circuits via partial derivatives," Computational Complexity 6 (1996), pp. 217-234.
-
(1996)
Computational Complexity
, vol.6
, pp. 217-234
-
-
Nisan, N.1
Wigderson, A.2
-
22
-
-
0003370550
-
Why is boolean complexity theory difficult?
-
M. Paterson, ed., London Mathematical Society Lecture Notes Series 169, Cambridge University Press
-
L. VALIANT, "Why is boolean complexity theory difficult?" in Boolean Function Complexity, M. Paterson, ed., London Mathematical Society Lecture Notes Series 169, Cambridge University Press, 1992.
-
(1992)
Boolean Function Complexity
-
-
Valiant, L.1
|