arXiv (All)
open access
Robust Approximation and the Arity Barrier at Width Two
Zwick's algorithm for Horn satisfiability shows that constraints of unbounded arity can admit a robust approximation guarantee independent of the arity. For finite constraint languages, Barto and Kozik proved that robust approximability is characterized by bounded width. We ask whether arity-indepen
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
- Towards Numerical TOHTN Planning with SMT-based HTN-SAT Encoding#926801
- Toward a Characterization of Simulation Between Arithmetic Theories#1155182
- The existence of polyhedral invariants is undecidable for linear systems#1105704
- The Maximum Singularity Degree for Linear and Semidefinite Programming#1013374
- Bounded Reach, Unbounded Reflection: A Phenomenological Argument Against the Computability of Human Mathematical Judgment#708597
Record · ID 1141739
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