Revisiting maximum satisfiability and related problems in data streams
From MaRDI portal
Publication:6113841
DOI10.1007/978-3-031-22105-7_17arXiv2208.09160OpenAlexW4313351387MaRDI QIDQ6113841
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.09160
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the minimum satisfiability problem
- Some simplified NP-complete graph problems
- On dependent randomized rounding algorithms
- On approximation algorithms for the minimum satisfiability problem
- Parallel approximation algorithms by positive linear programming
- A constraint optimization approach to causal discovery from subsampled time series data
- Maximum satisfiability in software analysis: applications and techniques
- Densest Subgraph in Dynamic Graph Streams
- Random sampling with a reservoir
- The Minimum Satisfiability Problem
- On the Approximation of Maximum Satisfiability
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
- An optimal space lower bound for approximating MAX-CUT
- Sublinear Algorithms for (Δ + 1) Vertex Coloring
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- Some optimal inapproximability results
- The complexity of theorem-proving procedures
- Approximation and Online Algorithms
- Revisiting maximum satisfiability and related problems in data streams
This page was built for publication: Revisiting maximum satisfiability and related problems in data streams
