arXiv (All)
open access
Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains
Building on the bit-complexity framework of Raghavendra-Weitz and the moment-SOS criteria of Gribling-Polak-Slot, we study the effective use of truncated vanishing identities over Boolean polynomial systems. A complete, constructible identity space gives an augmented moment SDP that can be optimized
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
- Rational Identity Testing for Noncommutative Circuits is in Polynomial Space#1141362
- Exponential Correlation Bounds for Polynomials#1076495
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189148
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189098
- Non-norm criteria and optimal $2\times 2$ space-time block codes over rings of integers of imaginary quadratic fields#189048
Record · ID 1142234
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