Pages that link to "Item:Q4170251"

The following pages link to Lower Bounds for Selection in <i>X</i> + <i>Y</i> and Other Multisets (Q4170251):

Displayed 15 items.

• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) ‎ (← links)
• Selection in \(X+Y\) and matrices with sorted rows and columns (Q761793) ‎ (← links)
• The complexity of the \(K\)th largest subset problem and related problems (Q894449) ‎ (← links)
• The complexity of searching in \(X+Y\) and other multisets (Q911276) ‎ (← links)
• Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) ‎ (← links)
• Complexity of selection in \(X+Y\) (Q1124333) ‎ (← links)
• The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291) ‎ (← links)
• On the spanning trees of weighted graphs (Q1204524) ‎ (← links)
• Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) ‎ (← links)
• Optimal algorithms for generalized searching in sorted matrices (Q1389660) ‎ (← links)
• Bi-immunity separates strong NP-completeness notions (Q1887166) ‎ (← links)
• Algorithm 616: fast computation of the Hodges-Lehmann location estimator (Q3343393) ‎ (← links)
• Percentile queries in multi-dimensional Markov decision processes (Q5892424) ‎ (← links)
• The computational complexity of the criticality problems in a network with interval activity times (Q5953342) ‎ (← links)
• On the spanning trees of weighted graphs (Q6199477) ‎ (← links)