Reducibility and computational lower bounds for problems with planted sparse structure

Matthew Brennan and Guy Bresler and Wasim Huleihel

misc2018

Citation key: BrennanBreslerHuleihel2018
Year: 2018
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Matthew Brennan, Guy Bresler, and Wasim Huleihel, “Reducibility and computational lower bounds for problems with planted sparse structure,” Proceedings of COLT 2018, PMLR 75, 48–166, https://proceedings.mlr.press/v75/brennan18a.html.

Catalog connections

Conjectures citing this source

TCS-022Planted Clique ConjectureTheoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Matthew Brennan and Guy Bresler and Wasim Huleihel
note: Matthew Brennan, Guy Bresler, and Wasim Huleihel, “Reducibility and computational lower bounds for problems with planted sparse structure,” Proceedings of COLT 2018, PMLR 75, 48--166, https://proceedings.mlr.press/v75/brennan18a.html.
title: Reducibility and computational lower bounds for problems with planted sparse structure
url: https://proceedings.mlr.press/v75/brennan18a.html
year: 2018