Tight Bounds for the Subspace Sketch Problem With Applications

doi 10.1137/1.9781611975994.102
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

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

Sketch-Based Subspace Clustering of Hyperspectral Images

Remote Sensing
EarthPlanetary Sciences
2020English

Tight Bounds for Adopt-Commit Objects

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2013English

The Invariant Subspace Problem

Fixed Point Theorems and Applications
2019English

The Invariant Subspace Problem

A Fixed-Point Farrago
2016English

Tight Bounds for Parallel Randomized Load Balancing

2011English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Tight Worst-Case Bounds for Polynomial Loop Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy