Sparsification of Binary CSPs
From MaRDI portal
Publication:5090464
DOI10.4230/LIPICS.STACS.2019.17OpenAlexW2963916529MaRDI QIDQ5090464FDOQ5090464
Authors: Silvia Butti, S. Zivny 
Publication date: 18 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10256/pdf/LIPIcs-STACS-2019-17.pdf/
Recommendations
Cites Work
- Twice-Ramanujan sparsifiers
- Spectral sparsification of graphs
- A general framework for graph sparsification
- Graph sparsification by effective resistances
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- The complexity of general-valued CSPs
- On multiplicative \(\lambda\)-approximations and some geometric applications
- Graph Sparsification in the Semi-streaming Model
- Title not available (Why is that?)
- Best-case and worst-case sparsifiability of Boolean CSPs
- Sketching cuts in graphs and hypergraphs
- Bigraphs versus digraphs via matrices
- Spectral sparsification of hypergraphs
- On sketching quadratic forms
- Sparsification of two-variable valued constraint satisfaction problems
Cited In (6)
- Additive Sparsification of CSPs.
- Variable Elimination in Binary CSPs
- Sparsification of SAT and CSP Problems via Tractable Extensions
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- Sparsification of binary CSPs
- The algebraic structure of the densification and the sparsification tasks for CSPs
This page was built for publication: Sparsification of Binary CSPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090464)
