Lower bounds for sorting of sums
type: Item
instance of: scholarly article
title: Lower bounds for sorting of sums
zbMATH Open document ID: 0686.68034
DOI: 10.1016/0304-3975(89)90132-1
author: Martin Dietzfelbinger
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
review text: See the review in Zbl 0637.68065.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 4125008
zbMATH Keywords: lower bounds
zbMATH Keywords: algorithmical complexity
zbMATH Keywords: sorting
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90132-1
OpenAlex ID: W2067618361
cites work: Lower bound arguments with ``inaccessible'' numbers
cites work: On the complexity of computations under varying sets of primitives
cites work: How good is the information theory bound in sorting?
cites work: Sorting X + Y
cites work: Balancing poset extensions
cites work: A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
cites work: Q4739657
cites work: Comparisons between linear functions can help
cites work: Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model
description: scientific article; zbMATH DE number 4125008