arXiv (All)
open access
Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation
We study randomized nonuniform polynomial-size transformations that output explicit binary affine filters for circuit inputs whose nonempty satisfying sets are affine. The filter may depend on the entire input description; no affine basis is supplied. For every fixed $δ<1$, a worst-case singleton su
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
- Toward a Generalized Defense Across Sparse, Continuous, and Structured Parameter Attacks#259572
- On the computation of rational solutions of underdetermined systems over a finite field#228842
- Strongly Refuting Semirandom Linear Systems in Subexponential Time#1078123
- Discrete-time polynomial systems with inputs and outputs: structure, reachability, observability, and minimal realizations#1131265
- The strong converse exponent of composable randomness extraction against quantum side information#1116194
Record · ID 1248712
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