Noncommutativity makes determinants hard? Markus Bl¨aser1 Saarland University Abstract. We consider the complexity of computing the determinant

First Page		Document Content
Date: 2014-01-17 05:35:19 Algebra Mathematics Algebras Linear algebra Matrix theory Ring theory Semisimple algebra Algebra over a field Nilpotent Commutative algebra Associative algebra Von Neumann algebra		Noncommutativity makes determinants hard? Markus Bl¨aser1 Saarland University Abstract. We consider the complexity of computing the determinant Add to Reading List Source URL: www-cc.cs.uni-saarland.de Download Document from Source Website File Size: 442,49 KB Share Document on Facebook

	Solutions of Qualifying Exams I, 2013 Fall 1. (Algebra) Consider the algebra M2 (k) of 2 × 2 matrices over a field k. Recall that an idempotent in an algebra is an element e such that e2 = e. (a) Show that an idempotent DocID: 1ufuC - View Document
	COMPUTATION OF OUTER AUTOMORPHISMS OF CENTRAL-SIMPLE ALGEBRAS TIMO HANKE1 Abstract. The paper presents algorithms for extending a field automorphism to a given finite-dimensional central-simple algebra over that field an DocID: 1s9Cg - View Document
	CUBE-TERMS, FINITELY RELATED ALGEBRAS, AND CSP Abstract. We prove that a finite idempotent algebra is inherently finitely related if and only if it has a cube-term, find the maximal idempotent clones that do not contain DocID: 1rsu4 - View Document
	619 Documenta Math. The Classification of Real Purely Infinite Simple C*-Algebras DocID: 1rraO - View Document
	ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over DocID: 1roCB - View Document