Nine lower bound conjectures on streaming approximation algorithms for CSPs

2025-10-12

AI Summary

This paper investigates the approximate solvability of Constraint Satisfaction Problems (CSPs) under the low-space streaming computation model. Methodologically, it systematically synthesizes recent multi-author advances on upper and lower bounds for streaming CSP algorithms, integrating insights from streaming model characteristics, approximation algorithm theory, and complexity-theoretic analysis. The work abstracts and formalizes the core structural sources of approximation hardness for CSPs in streaming settings. As its primary contribution, it proposes— for the first time—a unified framework of nine conjectured streaming lower bounds on CSP approximation; several of these are novel to the field. These conjectures span diverse constraint types (e.g., Boolean, hypergraph-based) and streaming model variants (e.g., insertion-only, dynamic, vertex-arrival). Collectively, they fill a critical theoretical gap and provide precise, actionable directions for establishing tight complexity characterizations, designing optimal streaming algorithms, and proving rigorous lower bounds for CSPs in the streaming paradigm.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Data Mining & Knowledge Management: Data Stream Mining

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Systems and Infrastructure for Web, Mobile and WoT: Data management and stream processing for Web, mobile and wireless applications
• Web Mining and Content Analysis: Models for Web evolution

Abstract

In this column, we overview recent progress by many authors on understanding the approximability of constraint satisfaction problems (CSPs) in low-space streaming models. Inspired by this recent progress, we collate nine conjectural lower bounds against streaming algorithms for CSPs, some of which appear here for the first time.

Problem

• Investigating streaming approximation algorithms for constraint satisfaction problems
• Proposing nine conjectural lower bounds on CSP streaming algorithms
• Analyzing CSP approximability in low-space streaming computational models

Innovation

• Proposes nine conjectural streaming lower bounds
• Focuses on constraint satisfaction problems approximation
• Analyzes algorithms in low-space streaming models