scientific article; zbMATH DE number 3846871

zbMATH Open0533.68045MaRDI QIDQ3316593FDOQ3316593

Authors: Stefan Reisch 

Publication date: 1982

Title of this publication is not available (Why is that?)

zbMATH Keywords

lower boundsKolmogorov complexityupper boundssorting algorithmsrun time bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cited In (1)

• Upper bounds for sorting integers on random access machines

This page was built for publication:

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