Berechnung und Programm. II

DOI10.1007/BF00571464MaRDI QIDQ2559922zbMATH OpenFDO

Authors Volker Strassen

Publication date 1973

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3557235 (Why is no real title available?)
• scientific article; zbMATH DE number 3227055 (Why is no real title available?)
• scientific article; zbMATH DE number 3252196 (Why is no real title available?)
• scientific article; zbMATH DE number 3326459 (Why is no real title available?)
• scientific article; zbMATH DE number 3338350 (Why is no real title available?)
• Berechnung und Programm. I
• Berechnungen in partiellen Algebren endlichen Typs
• Computational complexity of random access stored program machines
• FOUNDATIONS OF ALGEBRAIC GEOMETRY
• Random-Access Stored-Program Machines, an Approach to Programming Languages

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2559922)