Volker Strassen

From MaRDI portal
Revision as of 21:07, 22 September 2023 by Import230922100944 (talk | contribs) (Created automatically from import230922100944)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1171379

Available identifiers

zbMath Open strassen.volkerDBLP92/1417FactGridQ885982WikidataQ65212 ScholiaQ65212MaRDI QIDQ1171379

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50752892022-05-12Paper
Evaluation of Rational Functions2021-07-06Paper
Obituary: Konrad Jacobs (1928--2015)2017-10-11Paper
Asymptotic spectrum and matrix multiplication2015-03-27Paper
Complexity and geometry of bilinear maps2005-06-23Paper
Asymptotic degeneration of representations of quivers2001-10-23Paper
https://portal.mardi4nfdi.de/entity/Q47182321998-12-13Paper
https://portal.mardi4nfdi.de/entity/Q43855171998-05-04Paper
https://portal.mardi4nfdi.de/entity/Q43243431995-02-23Paper
Degeneration and complexity of bilinear maps: Some asymptotic spectra.1992-06-25Paper
The asymptotic spectrum of tensors.1988-01-01Paper
Relative bilinear complexity and matrix multiplication.1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38137751987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37198291985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36902121984-01-01Paper
Rank and optimal computation of generic tensors1983-01-01Paper
The complexity of partial derivatives1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33165871983-01-01Paper
The Computational Complexity of Continued Fractions1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37074061982-01-01Paper
On the algorithmic complexity of associative algebras1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39471161981-01-01Paper
Some polynomials that are hard to compute1980-01-01Paper
Erratum: A Fast Monte-Carlo Test for Primality1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41958451978-01-01Paper
A Fast Monte-Carlo Test for Primality1977-01-01Paper
Some results on computational complexity1976-01-01Paper
Computational Complexity over Finite Fields1976-01-01Paper
Die Berechnungskomplexität der symbolischen Differentiation von Interpolationspolynomen1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41110921975-01-01Paper
Minimax tests and the Neyman-Pearson lemma for capacities. Correction1974-01-01Paper
Polynomials with Rational Coefficients Which are Hard to Compute1974-01-01Paper
Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten1973-01-01Paper
Berechnung und Programm. II1973-01-01Paper
Minimax tests and the Neyman-Pearson lemma for capacities1973-01-01Paper
Berechnungen in partiellen Algebren endlichen Typs1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32144261973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40470291973-01-01Paper
Berechnung und Programm. I1972-01-01Paper
Fast multiplication of large numbers1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56128341970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56172261970-01-01Paper
Gaussian elimination is not optimal1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55927351969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55827211968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56005311967-01-01Paper
A converse to the law of the iterated logarithm1966-01-01Paper
The Existence of Probability Measures with Given Marginals1965-01-01Paper
Me\fehler und Information1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53404591964-01-01Paper
An invariance principle for the law of the iterated logarithm1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55165141962-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Volker Strassen