The recursive structure of some ordering problems

DOI10.1007/BF01931280MaRDI QIDQ802870zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1991

Published in BIT (Search for Journal in Brave)

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

zbMATH Keywords

ordering problemsUpper and lower boundsrelative complexity

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3861164
• Finding an Approximate Maximum
• On selecting the k largest with median tests
• Searching ordered structures
• Average case selection

Cites work

• scientific article; zbMATH DE number 4110087 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Finding the median

Cited in

(8)

• scientific article; zbMATH DE number 966391 (Why is no real title available?)
• On the Complexity of Some Ordering Problems
• The number of preference orderings: a recursive approach
• Optimal composition ordering problems for piecewise linear functions
• The number of depth-first searches of an ordered set
• Coupled bisection for root ordering
• scientific article; zbMATH DE number 3947421 (Why is no real title available?)
• A Knuth-Bendix-like ordering for orienting combinator equations

This page was built for publication: The recursive structure of some ordering problems

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