Selection problems via \(m\)-ary queries

DOI10.1007/BF01272077zbMath0770.68068OpenAlexW1588548598MaRDI QIDQ2366172

Jim Purtilo, Katia S. Guimarães, William I. Gasarch

Publication date: 29 June 1993

Published in: Computational Complexity (Search for Journal in Brave)

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

zbMATH Keywords

lower boundsselection problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

On selecting the \(k\) largest with restricted quadratic queries

Cites Work

• Unnamed Item
• On selecting the k largest with median tests
• Comparisons between linear functions can help
• On selecting the \(k\) largest with restricted quadratic queries
• Proving simultaneous positivity of linear forms
• Applications of Ramsey's theorem to decision tree complexity
• A New Lower Bound for the Set-Partitioning Problem
• A Counting Approach to Lower Bounds for Selection Problems

This page was built for publication: Selection problems via \(m\)-ary queries