arXiv (All)
open access
Improved Space Bounds for Promise Graph Coloring in Adversarial Streams
We study promise graph coloring in one pass insertion-only adversarial streams. We give a randomized algorithm that distinguishes 3-colorable graphs from graphs that are not 6-colorable using $O(n^{3/2}\log(n/\varepsilon)\log n)$ bits of space. This provides a truly subquadratic space algorithm for
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quality control in sublinear time: a case study via random graphs#1357035
- QPTAS for Max Weight Independent Set in Graphs with Strongly Edge-Sublinear Separators#1327615
- Breadth Beats Depth: Improving GCG-Based Jailbreak Optimization with Breadth-Oriented Suffix Search#822567
- Small-Perturbation Adversarial Example Detection via Proactive Decision Boundary Bending#387395
- PGID: Progressive Guided Inversion and Denoising for Robust Watermark Detection#1343577
Record · ID 1389590
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive