Amanote Research

Amanote Research

    RegisterSign In

Efficient Algorithms and Lower Bounds for Robust Linear Regression

doi 10.1137/1.9781611975482.170
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2019

Authors
Ilias DiakonikolasWeihao KongAlistair Stewart
Publisher

Society for Industrial and Applied Mathematics


Related search

Effective Lower Bounds for Some Linear Forms

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Robust Randomness Amplifiers: Upper and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Efficient Distributed Decision Trees for Robust Regression

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2006English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Efficient Algorithms for Parametric Non-Linear Instability Analysis

International Journal of Non-Linear Mechanics
Mechanics of MaterialsApplied MathematicsMechanical Engineering
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy