AI Chat AI Image Generator AI Video Text to Speech

Streaming and Sketching Complexity of CSPs: A survey

05/05/2022

∙

by Madhu Sudan, et al.

∙

∙

In this survey we describe progress over the last decade or so in understanding the complexity of solving constraint satisfaction problems (CSPs) approximately in the streaming and sketching models of computation. After surveying some of the results we give some sketches of the proofs and in particular try to explain why there is a tight dichotomy result for sketching algorithms working in subpolynomial space regime.

page 1

page 2

page 3

page 4

research

∙ 03/18/2018

Complexity problems in enumerative combinatorics

We give a broad survey of recent results in Enumerative Combinatorics an...

0 Igor Pak, et al. ∙

research

∙ 07/07/2020

Streaming Complexity of SVMs

We study the space complexity of solving the bias-regularized SVM proble...

0 Alexandr Andoni, et al. ∙

research

∙ 05/04/2021

Streaming approximation resistance of every ordering CSP

An ordering constraint satisfaction problem (OCSP) is given by a positiv...

0 Noah Singer, et al. ∙

research

∙ 04/13/2023

On streaming approximation algorithms for constraint satisfaction problems

In this thesis, we explore streaming algorithms for approximating constr...

0 Noah G. Singer, et al. ∙

research

∙ 03/13/2022

Distributed Subgraph Finding: Progress and Challenges

This is a survey of the exciting recent progress made in understanding t...

0 Keren Censor-Hillel, et al. ∙

research

∙ 05/02/2019

Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity

Streaming algorithms are generally judged by the quality of their soluti...

4 Ehsan Kazemi, et al. ∙

research

∙ 05/17/2023

The Complexity of Diagonalization

We survey recent progress on efficient algorithms for approximately diag...

0 Nikhil Srivastava, et al. ∙