arXiv (All)
open access
Non-Local Search-to-Decision Reduction over F2, and More
Non-local search-to-decision asks whether the difficulty of two non-communicating (non-local) parties both predicting x given a bipartite state (that possibly depends on x) implies the difficulty of non-local parties both predicting the inner product , for a uniformly random r. This problem and
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
- Socially Fair Clustering: Parameterized Approximation and Local Search#799269
- Socially Fair Clustering: Parameterized Approximation and Local Search#797846
- New Possibilities for Fair Algorithms#110761
- A Simple Construction of Locally Checkable Problems Filling the LOCAL Complexity Gaps in Graphs with Arbitrary Large Degrees#971857
- Iterated Exact and Heuristic Algorithms for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Constraints#210381
Record · ID 1130610
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