Berechnungen in partiellen Algebren endlichen Typs

DOI10.1007/BF02252909zbMath0265.68030MaRDI QIDQ2561967

Volker Strassen

Publication date: 1973

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Software, source code, etc. for problems pertaining to group theory (20-04) Software, source code, etc. for problems pertaining to ordered structures (06-04) Software, source code, etc. for problems pertaining to field theory (12-04) Algebraic structures (08Axx) Software, source code, etc. for problems pertaining to general algebraic systems (08-04)

Related Items

Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits, Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen, A survey of techniques in applied computational complexity, Realizing Boolean functions on disjoint sets of variables, On Bellman's and Knuth's problems and their generalizations, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, Berechnung und Programm. I, Berechnung und Programm. II

Cites Work

• Berechnung und Programm. I
• Optimal algorithms for parallel polynomial evaluation
• On the Computational Complexity of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item