arXiv (All)
open access
Approximate Polynomial Satisfiability is in the Counting Hierarchy
The Approximate polynomial satisfiability problem (APS), introduced by Guo, Saxena, and Sinhababu (CCC 2018), asks whether the zero vector lies in the Zariski closure of the image of a given polynomial map. Specifically, for a field $k$ with algebraic closure~$K$, the problem asks whether $\boldsymb
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
- Дифференциация заработной платы и проблемы мотивации труда в контексте решения ключевых задач индустриального освоения Западной Сибири в период первой пятилетки (1928–1932 гг.)#634451
- Appraising Objections to Practical Apatheism#739447
- Tree metrics and log-concavity for matroids#1014587
- Recursive Datum Expansion and the Structural Interpretation of Time#713956
- Rejection in Łukasiewicz's and Słupecki's Sense#778095
Record · ID 1155579
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