On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, 
Avenues and Algorithmic Progress

Künnemann, Marvin

doi:10.4230/LIPIcs.ESA.2018.56

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress

MPS-Authors

/persons/resource/persons44857

Künnemann, Marvin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/9519/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Künnemann, M. (2018). On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. In Y. Azar, H. Bast, & G. Herman (Eds.), 26th Annual European Symposium on Algorithms (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2018.56.

Cite as: https://hdl.handle.net/21.11116/0000-0002-A8F1-0

Abstract

There is no abstract available