Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Zur Komplexität von Sortierproblemen

From MaRDI portal
Publication:1393273
Jump to:navigation, search

DOI10.1007/BF00288635zbMath0276.68021OpenAlexW2053435410MaRDI QIDQ1393273

D. Massart

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288635



Mathematics Subject Classification ID

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


Related Items (1)

The complexity of matrix transposition on one-tape off-line Turing machines with output tape




Cites Work

  • Unnamed Item




This page was built for publication: Zur Komplexität von Sortierproblemen

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1393273&oldid=13550491"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 15:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki