Comparison-Based Time–Space Lower Bounds for Selection

doi 10.1137/1.9781611973068.17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Space Lower Bounds for Itemset Frequency Sketches

2016English

Sampling-Based Lower Bounds for Counting Queries

Intelligenza Artificiale
Artificial Intelligence
2011English

Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2016English

Minimizing Average Flow-Time : Upper and Lower Bounds

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer NetworksOpticsMolecular Physics,CommunicationsOpticalAtomicMagnetic MaterialsElectronic
2007English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy