Berechnung und Programm. II
From MaRDI portal
Publication:2559922
DOI10.1007/BF00571464zbMATH Open0258.68022MaRDI QIDQ2559922FDOQ2559922
Authors: Volker Strassen 
Publication date: 1973
Published in: Acta Informatica (Search for Journal in Brave)
General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Berechnung und Programm. I
- Title not available (Why is that?)
- Random-Access Stored-Program Machines, an Approach to Programming Languages
- Computational complexity of random access stored program machines
- Title not available (Why is that?)
- FOUNDATIONS OF ALGEBRAIC GEOMETRY
- Berechnungen in partiellen Algebren endlichen Typs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Some computational problems in linear algebra as hard as matrix multiplication
- On genuinely time bounded computations
- A survey of techniques in applied computational complexity
- Some independence results in complexity theory†
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- Some elementary proofs of lower bounds in complexity theory
- Fast algorithms for the characteristic polynomial
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)
