Berechnung und Programm. II

DOI10.1007/BF00571464zbMath0258.68022MaRDI QIDQ2559922

Volker Strassen

Publication date: 1973

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items (7)

Some independence results in complexity theory^† ⋮ On genuinely time bounded computations ⋮ Some computational problems in linear algebra as hard as matrix multiplication ⋮ A survey of techniques in applied computational complexity ⋮ Some elementary proofs of lower bounds in complexity theory ⋮ The Projective Noether Maple Package: Computing the dimension of a projective variety ⋮ Fast algorithms for the characteristic polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Berechnung und Programm. I
• Berechnungen in partiellen Algebren endlichen Typs
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• FOUNDATIONS OF ALGEBRAIC GEOMETRY
• Computational complexity of random access stored program machines

This page was built for publication: Berechnung und Programm. II