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

DOI10.1016/0020-0190(91)90099-4zbMath0737.68042OpenAlexW2063108663MaRDI QIDQ1178226

William I. Gasarch

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90099-4

zbMATH Keywords

queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Selection problems via \(m\)-ary queries ⋮ Selecting the \(k\) largest elements with parity tests ⋮ Decision trees: Old and new results.

Cites Work

• On selecting the k largest with median tests
• Proving simultaneous positivity of linear forms
• Selection problems via \(m\)-ary queries
• A Counting Approach to Lower Bounds for Selection Problems

This page was built for publication: On selecting the \(k\) largest with restricted quadratic queries